On split graphs with four distinct eigenvalues

It is a well-known fact that a graph of diameter d has at least d+1 eigenvalues. A graph is d-extremal, if it has diameter d and exactly d+1 eigenvalues. A graph is split if its vertex set can be partitioned into a clique and a stable set. Such graphs have diameter at most 3. We obtain a complete cl...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics 2020-04, Vol.277, p.163-171
Hauptverfasser:	Goldberg, Felix, Kirkland, Steve, Varghese, Anu, Vijayakumar, Ambat
Format:	Artikel
Sprache:	eng
Schlagworte:	Adjacency matrix Bidegreed graph Combinatorial analysis Combinatorial design Eigenvalues Graphs Split graph
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!