On a Combinatorial Problem on the Star Graphs

摘要

We present a comprehensive survey of works on the combinatorial problem of finding the number of nodes whose distance from the identity node is i in an n-star graph S_n, for i = 1, 2, ..., D(n), where D(n) is the diameter of the graph S_n.