1

A Diameter 4 Graph in Sum Swap Equilibrium

Figure 1: A diameter 4 graph in sum swap equilibrium.

Theorem 1.1. There exists a diameter 4 sum swap equilibrium graph. Specifically, the graph in Figure 1 has diameter 4 and is in sum swap equilibrium.
The graph in Figure 1 has been computationally verified to be in sum swap
equilibrium by checking all 492 possible swaps with 13 distance changes per
swap. For completeness we also prove it here, but use symmetry to reduce the
number of distinct swaps to 27 with at most XXX distinct distance changes per
swap. We use the following observations to assist in the proof.
Observation 1.2. If dpu, vq 2, then for w1 v and pu, wq not on every
length 2 path between u and v, swapping an edge pu, wq with pu, w1 q leaves the
distance dpu, vq unchanged.
Proof. Because pu, w1 q is not on every shortest path between u and v, a path of
that length is preserved. Any new path must go through pu, w1 q and any path
to v must go along an edge including v. Since v u and v w1 , any new path
to v must be at least length two. Therefore dpu, vq remains unchanged.
Observation 1.3. If dpu, vq 3, then for w1 v, w1 not a neighbor of v, and
pu, w1 q not on every shortest path between u and v, swapping an edge uw with
uw1 does not change dpu, vq.
1

Proof. Because pu, w1 q is not on every shortest path between u and v, a path of
that length is preserved. Any new path must go through pu, w1 q and any path
to v must go along an edge including v and an edge including a neighbor of v.
Since w1 v and w1 not a neighbor of v, any new path must be at least length
three. Therefore dpu, vq remains unchanged.
Observation 1.4.
Proof. The diameter 4 sum swap equilibrium graph in Figure 1 is laid out in
the levels (labeled A, B, C, B 1 , A1 ) of a breadth-first-search tree rooted at one
of the nodes with local diameter 4. As suggested by the labeling, layers A and
B are symmetrical to their primed counterparts. Every node in each layer is
equivalent. Therefore we need only examine the swaps available to a single A,
B, and C node. For the duration of this proof, we use i to index the B layer,
j to index the B 1 layer, and k, l, and m to index the C layer. bi refers to the
node in layer B that is not bi and b1j is defined similarly. k is always not equal
to l and m. ck refers to the C node connected directly to ck and opposite to it
as the graph is drawn. bi , bj , and ck are defined such that pbi , ck q, pbj , ck q P E.
We now move to analyzing the 27 distinct swaps:

1.1

Nodes in A and A1

We begin with node a P A

If a swaps edge pa, bi q with edge pa, ck q:
dpa, bi q increases by 1, replacing the path abi with ack bi
dpa, cl q for the three cl s.t. pcl , bi q P E increases by 1, replacing the
path abi cl with abi cl cl
dpa, ck q decreases by 1, replacing the path abi ck with ack
dpa, b1j q decreases by 1, replacing the path abi ck b1j with ack b1j
dpa, a1 q decreases by 1, replacing the path abcb1 a1 with ack b1j a1
The distances to bi and the four cl s.t. pcl , bi q P E remain unchanged
by Lemma ??
dpa, b1j q remains unchanged by Lemma 1.3.
Therefore the sum of distances from a increases by 1 overall.
If a swaps pa, bi q with pa, ck q:
dpa, bi q increases by 2, replacing the path abi with ack ck bi
dpa, ck q decreases by 1, replacing the path abi ck with ack .
dpa, cl q for the three cl s.t. pbi , cl q P E and l k all increase by 1,
replacing the path abi cl with abi cl cl
dpa, b1j q decreases by 1, replacing the path abi ck b1j with ack b1j
2

 dpa, a1 q decreases by 1, replacing the path abi ck b1j a1 with ack b1j a1
dpa, ck q remains unchanged, replacing the path abi ck with ack ck
The distances to bi and the three cl s.t. pcl , bi q P E remain unchanged
by Lemma ??
dpa, b1j q remains unchanged by Lemma 1.3
Therefore the sum of distances from a increases by 2 overall.
If a swaps pa, bi q with pa, b1j q.
dpa, bi q increases by 2, replacing the path abi with ab1j ck bi
dpa, cl q for the two cl s.t. pcl , b1j q R E, pcl , bi q P E increases by 1,
replacing the path abi cl with ab1j cl cl
dpa, b1j q decreases by 2, replacing the path abi ck b1j with ab1j
dpa, a1 q decreases by 2, replacing the path abi ck b1j a1 with ab1j a1
dpa, ck q for both ck remains unchanged, replacing the path abi ck with
ab1j ck .
dpa, bi q and dpa, cl q for the four cl s.t. pcl , bi q P E remain unchanged
by Lemma ??
dpa, b1j q remains unchanged by Lemma 1.3
Therefore the sum of distances from a does not change overall.
If a swaps pa, bi q with pa, a1 q
dpa, bi q increases by 3, replacing the path abi with abi cl cl s.t. pcl , bi q P
E.
dpa, ck q s.t pck , bi q P E all four increase by 1, replacing the path abi ck
with the path abi ck ck
dpa, a1 q decreases by 3, replacing the path abca1 with the path aa1
dpa, b1 q both decrease by 1, replacing path abcb1 going to aa1 b1
dpa, bi q and dpa, cl q for the four s.t. pcl , bi q P E remain unchanged by
Lemma ??
Therefore the sum of distances from a increases by 2 overall.
As there is an automorphism which maps A to A, the above cases hold for all
nodes in A and A and none will swap.

1.2

Nodes in B and B 1

Let us now examine bi P B

If bi swaps pbi , aq with pbi , bi q then:
dpbi , aq increases by 1, replacing the path bi a with bi bi a
dpbi , bi q decreases by 1, replacing the path bi abi with bi bi
The distances to all eight c P C and both b1 P B 1 remain unchanged
by Lemma ??
dpbi , a1 q remains unchanged by Lemma 1.3
Therefore the sum of distances from bi does not change overall.
If bi swaps pbi , aq with pbi , cl q s.t. pcl , bi q R E:
dpbi , aq increases by 2, replacing bi a with bi cl bi a
dpbi , cl q decreases by 1, replacing bi cl cl with bi cl
The distances to all 10 other nodes c P C, b P B, and b1 P B 1 remain
the same by Lemma ??
dpbi , a1 q remains the same by Lemma 1.3
Therefore the sum of distances from bi increases by 2 overall.
If bi swaps pbi , aq with pbi , b1j q:
dpbi , aq increases by 3, replacing bi a with bi ck ck bi a
dpbi , bi q increases by 1, replacing bi abi with bi ck ck bi
dpbi , b1j q decreases by 1, replacing bi ck b1j with bi b1j
dpbi , a1 q decreases by 1, replacing bi ck b1j a1 with bi b1j a1
Distance to all eight c P C stays the same by Lemma ??
dpbi , b1j q remains the same by Lemma ??
Therefore the sum of distances from bi increases by 2 overall.
If bi swaps pbi , aq to pbi , a1 q:
dpbi , aq increases by 3, replacing bi a with bi ck ck bi a
dpbi , bi q increases by 1, replacing bi abi with bi ck ck bi
dpbi , a1 q decreases by 2, replacing bi ck b1j a1 with bi a1
Distance to all c P C and b P B 1 remain the same by Lemma ??
Therefore the sum of distances from bi increases by 2 overall.
If bi swaps pbi , ck q with pbi , bi q:
dpbi , ck q increases by 2, replacing bi ck with bi bi ck ck
4

 dpbi , bi q decreases by 1, replacing bi abi with bi bi

dpbi , aq remains the same by Lemma ??
Distance to all seven other c P C and two b1 P B 1 remains the same
by Lemma ??
dpbi , a1 q remains the same by Lemma 1.3
Therefore the sum of distances from bi increases by 1 overall.
If bi swaps pbi , ck q with pbi , ck q :
dpbi , ck q increases by 1, replacing bi ck with bi ck ck .
dpbi , ck q decreases by 1, replacing bi ck ck with bi ck
Distances to all six other c P C, a P A, and both b1 P B 1 remain the
same by Lemma ??
dpbi , bi q remains the same by Lemma ??
dpbi , a1 q remains the same by Lemma 1.3
Therefore the sum of distances from bi does not change overall.
If bi swaps pbi , ck q with pbi , cl q s.t. pcl , bi q R E and cl ck :
dpbi , ck q increases by 2, replacing bi ck with bi cm b1j ck s.t. pcm , b1j q, pcm , bi q P
E.
dpbi , ck q increases by 1, replacing bi ck ck with bi cm b1j ck s.t. pcm , b1j q, pcm , bi q P
E.
dpbi , cl q decreases by 1, replacing bi cl cl with bi cl .
Distances to a, bi , b1j , b1j , and all other c P C are unchanged by
Lemma ??
dpbi , a1 q is unchanged by Lemma 1.3
Therefore the sum of distances from bi increases by 2 overall.
If bi swaps pbi , ck q with pbi , b1j q:
dpbi , ck q increases by 1, replacing bi ck with bi b1j ck
dpbi , ck q increases by 1, replacing bi ck ck with bi cl b1j ck s.t. pcl , bi q, pcl , b1j q P
E
dpbi , b1j q decreases by 1, replacing bi ck b1j with bi b1j
dpbi , a1 q decreases by 1, replacing bi ck b1j a1 with bi b1j a1
Distances to a, bi , b1j , and all six other c P C, remain the same by
Lemma ??
Therefore the sum of distances from bi does not change overall.
If bi swaps pbi , ck q with pbi , b1j q:
5

 dpbi , ck q increases by 2, replacing bi ck with bi cl b1j ck s.t. pcl , b1j q, pcl , bi q P

E
dpbi , b1j q decreases by 1, replacing bi cl b1j with bi b1j s.t. pcl , b1j q, pcl , bi q P
E
dpbi , a1 q decreases by 1, replacing bi ck b1j a1 with bi b1j a1
Distances to a, bi , b1j , and all seven other c P C remain the same by
Lemma ??
Therefore the sum of distances from bi does not change overall.
If bi swaps pbi , ck q with pbi , a1 q:
dpbi , ck q increases by 2, replacing bi ck with bi cl b1j ck s.t. pcl , b1j q, pcl , bi q P
E
dpbi , ck q increases 1, replacing bi ck ck with bi cl b1j ck s.t. pcl , b1j q, pcl , bi q P
E
dpbi , a1 q decreases by 2, replacing bi ck b1j a1 with bi a1
Distances to a, bi , both b1 P B 1 , and all six other c P C remain the
same by Lemma ??
Therefore the sum of distances from bi increase by 1.
As there is an automorphism which maps B to B, the above cases hold for all
nodes in B and B and none will swap.

1.3

Nodes in C and C 1

Let us now examine ck :

If ck swaps pck , bi q with pck , aq:
dpck , cl q for both cl s.t. pcl , bi q, pcl , b1j q P E increases by 1, replacing
ck bi cl with ck abi cl .
dpck , bi q increases by 1, replacing ck bi with ck abi .
dpck , aq decreases by 1, replacing ck bi a with ck a.
Distances to a1 , bi , b1j , b1j , ck , and all three other cl s.t. pcl , b1j q P E
remain unchanged by Lemma ??
dpck , cl q s.t. pcl , b1j q, pcl , bi q R E remains unchanged by Lemma 1.3
Therefore the sum of distances from ck increases by 2.
If ck swaps pck , bi q with pck , bi q:
dpck , bi q increases by 2, replacing ck bi with ck bi abi .
dpck , cl q for both cl s.t. pcl , bi q, pcl , b1j q P E increases by 1, replacing
ck bi cl with ck bi cl cl
6

 dpck , bi q decreases by 1, replacing ck ck bi with ck bi

dpck , cl q s.t. pcl , bi q, pcl , b1j q R E and cl ck decreases by 1, replacing
ck ck bi cl with ck bi cl .
dpck , aq remains unchanged, replacing ck bi a with ck bi a
Distances to a1 , b1j , b1j , ck , and the three other cl s.t. pcl , b1j q P E
remain unchanged by Lemma ??
Therefore the sum of distances from ck increases by 2.
If ck swaps pck , bi q with pck , cl q s.t. pcl , bi q, pcl , b1j q P E:
dpck , bi q increases by 1, replacing ck bi with ck cl bi
dpck , aq increases by 1, replacing ck bi a with ck cl bi a
dpck , cm q for both cm s.t. pcm , bi q, pcm , b1j q P E increases by 1, replacing ck bi cm with ck cl bi cm
dpck , cl q decreases by 1, replacing ck bi cl with ck cl
dpck , cl q decreases by 1, replacing ck ck bi cl with ck cl cl
Distances to a1 , bi , b1j , b1j , ck , and both cm s.t. pcm , bi q, pcm , b1j q P E
remain unchanged by Lemma ??
Therefore the sum of distances from ck increases by 2.
If ck swaps pck , bi q with pck , cl q s.t. pcl , bi q, pcl , b1j q P E:
dpck , bi q increases by 1, replacing ck bi with ck cl bi
dpck , aq increases by 1, replacing ck bi a with ck cl bi a
dpck , cm q s.t. pcm , bi q, pcm , b1j q P E and cm cl increases by 1, replacing ck bi cm with ck cl bi cm
dpck , cl q decreases by 1, replacing ck bi cl with ck cl
Distances to a1 , bi , b1j , b1j , ck , cm s.t. pcm , bi q, pcm , b1j q P E, and both
cp s.t. pcp , b1j q P E remain unchanged by Lemma ??
dpck , cm q s.t. pcm , b1j q, pcm , bi q P E and cm ck remains unchanged
by Lemma 1.3
Therefore the sum of distances from ck increases by 2.
If ck swaps pck , bi q with pck , cl q s.t. pcl , bi q, pcl , b1j q P E:
dpck , aq increases by 1, replacing ck bi a with ck cl bi a
dpck , cm q s.t. pcm , bi q, pcm , b1j q P E and cm cl increases by 1, replacing ck bi cm with ck ck b1j cm
dpck , bi q increases by 2, replacing ck bi with ck cl cl bi
dpck , cl q decreases by 1, replacing ck b1j cl with ck cl
7

 dpck , cl q remains unchanged, replacing ck bi cl with ck cl cL

Distances to a1 , bi , b1j , b1j , ck , and both cm s.t. pcm , b1j q P E and
cm cl all remain unchanged by Lemma ??
dpck , cm q s.t. pcm , b1j q, pcm , bi q P E and cm ck remains unchanged
by Lemma 1.3
Therefore the sum of distances from ck increases by 3.
If ck swaps pck , bi q with pck , cl q s.t. pcl , bi q, pcl , b1j q P E and cl ck :
dpck , bi q increases by 2, replacing ck bi with ck b1j cm bi s.t. pcm , b1j q, pcm , bi q P
E
dpck , aq increases by 1, replacing ck bi a with ck cl bi a
dpck , cm q for both cm s.t. pcm , bi q, pcm , b1j q P E increases by 1, replacing ck bi cm with ck cl b1j cm .
dpck , cl q decreases by 2, replacing ck ck bi cl with ck cl .
Distances to a1 , bi , b1j , b1j , ck , and all three cm s.t. pcm , b1j q P E remain
unchanged by Lemma ??
Therefore the sum of distances from ck increases by 3.
If ck swaps from pck , bi q with pck , b1j q:
dpck , bi q increases by 2, replacing ck bi with ck b1j cl bi s.t. pcl , b1j q, pcl , bi q P
E
dpck , aq increases by 1, replacing ck bi a with ck ck bi a
dpck , b1j q decreases by 1, replacing ck ck b1j with ck b1j
dpck , cl q s.t. pcl , b1j q, pcl , bi q P E and cl ck decreases by 1, replacing
ck ck b1j cl with ck b1j cl
dpck , cl q for both cl s.t. pcl , bi q, pcl , b1j q P E remain unchanged, replacing ck bi cl with ck b1j cl
Distances to a1 , bi , b1j , ck , and the other three cl s.t. pcl , b1j q P E
remain unchanged by Lemma ??
Therefore the sum of distances from ck increases by 1.
If ck swaps pck , bi q with pck , a1 q:
dpck , bi q increases by 2, replacing ck bi with ck b1j cm bi s.t. pcm , b1j q, pcm , bi q P
E
dpck , aq increases by 1, replacing ck bi a with ck ck bi a
dpck , cl q for both cl s.t. pcl , bi q, pcl , b1j q P E increases by 1, replacing
ck bi cl with ck ck b1j cl
8

 dpck , a1 q decreases by 1, replacing ck b1j a1 with ck a1

Distances to bi , b1j , b1j , ck , and all other three cl s.t. pcl , b1j q P E
remain unchanged by Lemma ??
dpck , cl q s.t. pcl , bi q, pcl , b1j q R E and cl ck remains unchanged by
Lemma 1.3
Therefore the sum of distances from ck increases by 4.
If ck swaps pck , ck q with pck , aq:
dpck , bk q increases by 2, replacing ck ck with ck abi ck
dpck , b1j q increases by 1, replacing ck ck b1j with ck b1j a1 b1j
dpck , aq decreases by 1, replacing ck bi a1 with ck a
dpck , bi remains unchanged, replacing ck ck bi with ck abi
Distances to a1 , bi , b1j , all three other cl s.t. pcl , bi q P E, and both cm
s.t. pcm , bi q, pcm , b1j q P E remain unchanged by Lemma ??
dpck , cl q s.t pcl , bi q, pcl , b1j q P E and cl cK remains unchanged by
Lemma 1.3
Therefore the sum of distances from ck increases by 2.
If ck swaps pck , ck q with pck , bi q:
dpck , ck q increases by 1, replacing ck ck with ck bi ck
dpck , b1j q increases by 1, replacing ck ck b1j with ck bi ck b1j
dpck , bi q decreases by 1, replacing ck ck bi with ck bi
dpck , cl q s.t. pcl , bi q, pcl , b1j q P E and cl ck decreases by 1, replacing
ck ck bi cl with ck bi cl
Distances to a, a1 , bi , b1j , the three other cl s.t. pcl , bi q P E, and both
cm s.t. pcm , bi q, pcm , b1j q P E remain the same by Lemma ??
Therefore the sum of distances from ck doesnt change overall.
If ck swaps pck , ck q with pck , cl q s.t. pcl , bi q, pcl , b1j q P E
dpck , ck q increases by 3, replacing ck ck with ck bi abi ck
dpck , bi q increases by 1, replacing ck ck bi with ck cl cl bi
dpck , b1j q increases by 1, replacing ck ck b1j with ck cl cl b1j
dpck , cl q decreases by 1, replacing ck bi cl with ck cl
dpck , cl q decreases by 1, replacing ck b1j cl cl with ck cl cl
Distances to a, a1 , bi , b1j , both cm , and both cm
s.t. pcm , bi q P E and
cm cl remain the same by Lemma ??
Therefore the sum of distances from ck increases by 3.
9

 If ck swaps pck , ck q with pck , cl q s.t. pcl , bi q, pcl , b1j q P E

dpck , ck q increases by 2, replacing ck ck with ck cl b1j ck
dpck , bi q increases by 1, replacing ck ck bi with ck cl cl bi
dpck , cl q decreases by 1, replacing ck bi cl with ck cl
dpck , b1j q remains the same, replacing ck ck b1j with ck cl b1j
dpck , cm q s.t. pcm , b1j q, pcm , bi q P E and cm ck remains the same
replacing the path ck ck b1j cm with ck cl b1j cm
Distances to a, a1 , bi , b1j , the three other cm s.t. pcm , b1j q P E, and cp
s.t. pcp , b1j q P E and cp cl remain the same by Lemma ??
Therefore the sum of distances from ck increases by 2.
If ck swaps pck , ck q with pck , cl q s.t. pcl , bi q, pcl , b1j q P E, the sum of distances changes in the same way as the above case because the B and B 1
nodes are symmetric.
If ck swaps pck , ck q with pck , cl q s.t. pcl , bi q, pcl , bj q P E and cl ck :
dpck , ck q increases by 2, replacing ck ck with ck cl b1j ck
dpck , cl q decreases by 2, replacing ck ck bi cl with ck cl
dpck , bi q and dpck , b1j q remain unchanged, replacing ck ck bi with ck cl bi
and ck ck b1j with ck cl b1j
The distances to a, a1 , bi , b1j , and the five other cm s.t. pcm , bi q P E
or pcm , b1j q P E remain unchanged by Lemma ??
Therefore the sum of distances from ck doesnt change overall.
We need not consider swaps to the B 1 or A1 layers as they are symmetrical to
swaps to the A and B layers. As there is an automorphism which maps C to
C 1 , the above cases hold for all nodes in C and C 1 and none will swap.
Therefore no node in the graph will swap and the graph is in Sum Swap
Equilibrium.

10