Abstract
A connected graph is a cactus if any two of its cycles have at most one common vertex. Let be the set of cacti on vertices with matching number S.C. Li and M.J. Zhang determined the unique graph with the maximum signless Laplacian spectral radius among all cacti in with . In this paper, we characterize the case . This confirms the conjecture of Li and Zhang(S.C. Li, M.J. Zhang, On the signless Laplacian index of cacti with a given number of pendant vetices, Linear Algebra Appl. 436, 2012, 4400--4411). Further, we characterize the unique graph with the maximum signless Laplacian spectral radius among all cacti on vertices.
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.