Weight assignment on equally weighted graph

Revision en1, by fack, 2020-07-13 10:32:23

Suppose I have a weighted graph with equal positive weight (let it be K) on each edge. Now I want to count the number of ways to assign weights to vertices SUCH THAT if there is an edge between X and Y then max(W[X], W[Y])=K where W[X] means assigned weight to vertex X.

can someone solve it in better than O(2^n). means for n<=40

Tags #graph theory, #colour, weight distribution

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English fack 2020-07-13 10:32:23 376 Initial revision (published)