paper

On the signless Laplacian spectral radius of -free -cyclic graphs

arXiv:1612.03538

Abstract

A -cyclic graph is a connected graph of order and size . In this paper, we determine the maximal signless Laplacian spectral radius and the corresponding extremal graph among all -free -cyclic graphs of order . Furthermore, we determine the first three unicyclic, and bicyclic, -free graphs whose spectral radius of the signless Laplacian is maximal. Similar results are obtained for the (combinatorial) Laplacian.

7 pages,3 figures

References in corpus (1)