Some Topological Properties of Star Connected Cycles
Information Processing Letters
First page number:
Last page number:
Star connected cycles are shown to be an undirected Cayley graph, and the graph automorphism group is determined. A routing algorithm is given, which finds an optimal path in polynomial time. The diameter and tight bounds on the average distance are computed.
Computer network protocols; Computer networks; Electronic data processing--Distributed processing; Routing (Computer network management)
Controls and Control Theory | Electrical and Computer Engineering | Electrical and Electronics | Electromagnetics and Photonics | Other Electrical and Computer Engineering
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.
Azevedo, M. M.,
Some Topological Properties of Star Connected Cycles.
Information Processing Letters, 58