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...

Full description

Saved in:

Bibliographic Details
Published in:	Graphs and combinatorics Vol. 35; no. 1; pp. 335 - 351
Main Authors:	Chen, Ming-Zhu, Liu, A-Ming, Zhang, Xiao-Dong
Format:	Journal Article
Language:	English
Published:	Tokyo Springer Japan 01.01.2019 Springer Nature B.V
Subjects:	Combinatorics Engineering Design Forests Graph theory Graphs Mathematics Mathematics and Statistics Original Paper Spectra Linear forest 05C50 Spectral radius Turán type extremal problem Bipartite graph 05C35 Spectral counterparts
ISSN:	0911-0119, 1435-5914
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!