Increasing the connectivity of the star graphs

The star graph Sn proposed by Akers et al. has many advantages over the n‐cube. We show that when a large number of vertices are deleted from Sn the resulting graph can have at most two components, one of which is small. We use this result to solve a successive augmentation problem for Sn. This, in...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Networks 2002-10, Vol.40 (3), p.165-169
Hauptverfasser:	Cheng, Eddie, Lipman, Marc J.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences augmentation connectivity Exact sciences and technology Interconnected networks interconnection networks Networks and services in france and abroad Telecommunications Telecommunications and information theory Teleprocessing networks. Isdn
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!