A -regular graph satisfies the neighborhood diversity condition if it is possible to label each vertex with one of such that for each vertex, all its neighbors have different labels.
Determine the sum of all satisfying such that the -hypercube graph satisfies the neighborhood diversity condition.
Clarification:
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
I claim that it is necessary and sufficient that n is a power of 2
First we show that it is necessary that n is a power of 2 . Suppose that there in fact is some such coloring. WLOG consider a color, call it α . Draw arrows from vertex v to vertex w whenever v and w are adjacent and w has color α . Note that it is possible for v to point to w while v points to w . The total number of such arrows is 2 n because by the neighborhood diversity condition we have exactly one leaving each vertex. Alternatively, let the number of vertices with color α be A . Then the number of arrows is n A , by counting the number of arrows (exactly n ) that terminate in a given vertex with color α . So n A = 2 n ⟹ n ∣ 2 n , as desired.
Now for the construction! Let n = 2 r . We can naturally assign a unique vector in F 2 2 r . The central insight is to design a "characteristic function" χ : F 2 2 r → F 2 r and to let χ ( v ) be the "color" of the vertex represented by v . Consider the natural bijection that takes entries of v ∈ F 2 2 r to F 2 r (say some entry of v maps to v ′ ). Now let e i ( v ′ ) give the i th entry of v ′ ∈ F 2 r , and let S i be the set of entries of v with e i ( v ) = 1 . Finally, let C ( v ′ ) give the value (either 0 or 1 ) at said entry in v . We will let χ ( v ) be the unique element of F 2 r satisfying e i ( χ ( v ) ) = Σ v ′ ∈ S i C ( v ′ ) , where the equality occurs in F 2 . So we need only show that given a vertex of the original hypercube, represented by v , there is a unique adjacent vertex, represented by w , with characteristic a ∈ F 2 r . But we can directly construct such a vertex; just switch the entry of v represented by χ ( v ) − a . Uniqueness follows by size (a surjection between finite sets of equal cardinality is necessarily a bijection).
Thus the answer is 1 + 2 + ⋯ + 5 1 2 = 1 0 2 3