Demo*graph*ics

A k k -regular graph satisfies the neighborhood diversity condition if it is possible to label each vertex with one of 1 , 2 , 3 , , k 1, 2, 3, \ldots, k such that for each vertex, all its neighbors have different labels.

Determine the sum of all n n satisfying 1 n 1000 1 \le n \le 1000 such that the n n -hypercube graph satisfies the neighborhood diversity condition.


Clarification:

  • In a k k -regular graph, each vertex has k k neighbors.
  • An n n -hypercube graph is the graph of an n n -dimensional hypercube. In other words, its vertices are elements of { 0 , 1 } n \{0,1\}^n (that is, n n -tuples with each component 0 or 1), and two vertices are adjacent if and only if they differ in exactly one component.
  • The labeling is not necessarily a proper vertex coloring: two adjacent vertices may have the same label.


The answer is 1023.

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.

1 solution

Rafay Ashary
Apr 23, 2017

I claim that it is necessary and sufficient that n n is a power of 2 2

First we show that it is necessary that n n is a power of 2 2 . Suppose that there in fact is some such coloring. WLOG consider a color, call it α \alpha . Draw arrows from vertex v v to vertex w w whenever v v and w w are adjacent and w w has color α \alpha . Note that it is possible for v v to point to w w while v v points to w w . The total number of such arrows is 2 n 2^n because by the neighborhood diversity condition we have exactly one leaving each vertex. Alternatively, let the number of vertices with color α \alpha be A A . Then the number of arrows is n A nA , by counting the number of arrows (exactly n n ) that terminate in a given vertex with color α \alpha . So n A = 2 n n 2 n nA=2^n\implies n\mid 2^n , as desired.

Now for the construction! Let n = 2 r n=2^r . We can naturally assign a unique vector in F 2 2 r \mathbb F_2^{2^r} . The central insight is to design a "characteristic function" χ : F 2 2 r F 2 r \chi:\mathbb F_2^{2^r}\to \mathbb F_2^r and to let χ ( v ) \chi(v) be the "color" of the vertex represented by v v . Consider the natural bijection that takes entries of v F 2 2 r v\in\mathbb F_2^{2^r} to F 2 r \mathbb F_2^r (say some entry of v v maps to v v' ). Now let e i ( v ) e_i(v') give the i th i^{\text{th}} entry of v F 2 r v'\in\mathbb F_2^r , and let S i S_i be the set of entries of v v with e i ( v ) = 1 e_i(v)=1 . Finally, let C ( v ) C(v') give the value (either 0 0 or 1 1 ) at said entry in v v . We will let χ ( v ) \chi(v) be the unique element of F 2 r \mathbb F_2^r satisfying e i ( χ ( v ) ) = Σ v S i C ( v ) e_i\left(\chi(v)\right)=\Sigma_{v'\in S_i}C(v') , where the equality occurs in F 2 \mathbb F_2 . So we need only show that given a vertex of the original hypercube, represented by v v , there is a unique adjacent vertex, represented by w w , with characteristic a F 2 r a\in\mathbb F_2^r . But we can directly construct such a vertex; just switch the entry of v v represented by χ ( v ) a \chi(v)-a . Uniqueness follows by size (a surjection between finite sets of equal cardinality is necessarily a bijection).

Thus the answer is 1 + 2 + + 512 = 1023 1+2+\cdots+512=\boxed{1023}

I'm still not sure what the question means.

Malcolm Rich - 4 years, 1 month ago

Log in to reply

What specific part can I clarify? :)

Rafay Ashary - 4 years, 1 month ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...