A well-behaved enumeration of star graphs
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.
Cayley graphs; Computer algorithms; Hamiltonian graph theory; Hypercube networks (Computer networks); Parallel computers
Computer and Systems Architecture | Digital Circuits | Digital Communications and Networking | Power and Energy | Systems and Communications
Use Find in Your Library, contact the author, or interlibrary loan to garner a copy of the item. Publisher policy does not allow archiving the final published version. If a post-print (author's peer-reviewed manuscript) is allowed and available, or publisher policy changes, the item will be deposited.
A well-behaved enumeration of star graphs.
IEEE Transactions on Parallel and Distributed Systems (TPDS), 6