Some topological properties of star connected cycles

Some topological properties of star connected cycles

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 1996-04, Vol.58 (2), p.81-85
Hauptverfasser: de Azevedo, Marcelo M., Bagherzadeh, Nader, Dowd, Martin, Latifi, Shahram
Format: Artikel
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Communications networks
Computer science
control theory
systems
Distributed computing
Distributed processing
Exact sciences and technology
Information retrieval. Graph
Interconnection network
Mathematical models
Network topologies
Routing
Star connected cycles
Studies
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0020-0190
1872-6119
DOI:10.1016/0020-0190(96)00041-5