The signless Laplacian spectral radius of graphs with no intersecting triangles
Combinatorics
2020-09-15 v2
Abstract
Let denote the -fan consisting of triangles which intersect in exactly one common vertex, and the complete split graph of order consisting of a clique on vertices and an independent set on the remaining vertices in which each vertex of the clique is adjacent to each vertex of the independent set. In this paper, it is shown that is the unique graph attaining the maximum signless Laplacian spectral radius among all graphs of order containing no , provided that and .
Keywords
Cite
@article{arxiv.2009.04738,
title = {The signless Laplacian spectral radius of graphs with no intersecting triangles},
author = {Yanhua Zhao and Xueyi Huang and Hangtian Guo},
journal= {arXiv preprint arXiv:2009.04738},
year = {2020}
}
Comments
10 pages