On the signless Laplacian spectral radius of $C_{4}$-free $k$-cyclic graphs
Qi Kong,
Ligong Wang
Abstract:A k-cyclic graph is a connected graph of order n and size n + k − 1. In this paper, we determine the maximal signless Laplacian spectral radius and the corresponding extremal graph among all C 4 -free k-cyclic graphs of order n. Furthermore, we determine the first three unicyclic, and bicyclic, C 4 -free graphs whose spectral radius of the signless Laplacian is maximal. Similar results are obtained for the (combinatorial) Laplacian.
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.