Class of graphs with restricted neighborhoods

A description is obtained for connected graphs in which a point u is adjacent of v only if u is adjacent to all points whose degree is greater than that of v. The minimum number of lines in such a grpah with all points having degree at least d is also determined. Finally, an application to communica...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of graph theory 1979, Vol.3 (3), p.257-262
Hauptverfasser: Rawlinson, Kim T., Entringer, R. C.
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A description is obtained for connected graphs in which a point u is adjacent of v only if u is adjacent to all points whose degree is greater than that of v. The minimum number of lines in such a grpah with all points having degree at least d is also determined. Finally, an application to communication systems is discussed.
ISSN:0364-9024
1097-0118
DOI:10.1002/jgt.3190030308