English

The signless Laplacian spectral radius of graphs with no intersecting triangles

Combinatorics 2020-09-15 v2

Abstract

Let FkF_k denote the kk-fan consisting of kk triangles which intersect in exactly one common vertex, and Sn,kS_{n,k} the complete split graph of order nn consisting of a clique on kk 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 Sn,kS_{n,k} is the unique graph attaining the maximum signless Laplacian spectral radius among all graphs of order nn containing no FkF_k, provided that k2k\geq 2 and n3k2k2n\geq 3k^2-k-2.

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