On a conjecture for the signless Laplacian spectral radius of cacti with given matching number

preprint2015arXivOpen access

Abstract

A connected graph GG is a cactus if any two of its cycles have at most one common vertex. Let ℓnm\ell_n^m be the set of cacti on nn vertices with matching number m.m. S.C. Li and M.J. Zhang determined the unique graph with the maximum signless Laplacian spectral radius among all cacti in ℓnm\ell_n^m with n=2mn=2m. In this paper, we characterize the case n≥2m+1n\geq 2m+1. 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 nn vertices.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.