A well-behaved enumeration of star graphs
Nader Bagherzadeh, M. Dowd, Seyed Milad Mir Latifi · IEEE Transactions on Parallel and Distributed Systems · 1995
An enumeration of star graphs is given which has many useful properties. For example an arbitrary prefix or suffix is connected; indeed the diameter is O(n). As a consequence, there is an O(n) interval broadcast algorithm. Prefixes which have t(n-1)! vertices for some t are especially well-behaved. The topology of, embeddings in, and algorithms for these graphs are considered, making use of the enumeration.>