Spectral Extremal Results with Forbidding Linear Forests

The Turán type extremal problems ask to maximize the number of edges over all graphs which do not contain fixed subgraphs. Similarly, their spectral counterparts ask to maximize spectral radius of all graphs which do not contain fixed subgraphs. In this paper, we determine the maximum spectral radiu...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Graphs and combinatorics 2019-01, Vol.35 (1), p.335-351
Hauptverfasser:	Chen, Ming-Zhu, Liu, A-Ming, Zhang, Xiao-Dong
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Engineering Design Forests Graph theory Graphs Mathematics Mathematics and Statistics Original Paper Spectra
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!