Abstract
The purpose of the work is to provide a solution to the long-standing problem of computing the distance distribution among the nodes in a star graph, i.e., computing the exact number of nodes at a distance k from the identity node in a star graph where k varies from 0 to the diameter of the graph. A star graph is a Cayley graph like a hypercube; for a hypercube Q n , there are exactly n r nodes at a distance r from the identity node where r varies from 0 to n .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have