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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.