Some Topological Properties of Star Connected Cycles
Document Type
Article
Publication Date
4-22-1996
Publication Title
Information Processing Letters
Volume
58
First page number:
81
Last page number:
85
Abstract
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.
Keywords
Computer network protocols; Computer networks; Electronic data processing--Distributed processing; Routing (Computer network management)
Disciplines
Controls and Control Theory | Electrical and Computer Engineering | Electrical and Electronics | Electromagnetics and Photonics | Other Electrical and Computer Engineering
Language
English
Permissions
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.
Repository Citation
Azevedo, M. M.,
Bagherzadeh, N.,
Dowd, M.,
Latifi, S.
(1996).
Some Topological Properties of Star Connected Cycles.
Information Processing Letters, 58
81-85.