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

References

• Chung FRK. Spectral graph theory, cbms regional conference series in mathematics. Vol. 92, Washington (DC): Publishied for the Conference Board of the Mathematical Sciences; 1997.
   Google Scholar
• Cvetkovi\‘{c} DM, Doob M, Sachs H. Spectral of graphs theory and applications. 3rd ed. Heidelberg: Johann Ambrosius Barth; 1995.
   Google Scholar
• Cvetkovic D, Rowlinson P, Simic S. An introduction to the theory of graph spectra. New York (NY): Cambridge University Press; 2010.
   Google Scholar
• Berman A, Plemmons RJ. Nonnegative matrices in the mathematical sciences. New York (NY): Academic Press; 1979.
   Google Scholar
• Bondy JA, Murty USR. Graph theory with applications. New York (NY): American Elsevier, 1976.
   Google Scholar
• Cai GX, Fan YZ. The signless Laplacian spectral radius of graphs with given chormatic number. Appl. Math. 2009;22:161–167.
   Google Scholar
• Cvetković D, Rowlinson P, Simić S. Signless Laplacians of finite graphs. Linear Algebra Appl. 2007;423:155–171.
   Web of Science ®Google Scholar
• Cvetković D, Simić S. Towards a spectral theory of graphs based on the signless Laplacian, I. Publ. Inst. Math. (Beograd). 2009;85:19–33.
   Google Scholar
• Cvetković D, Simić S. Towards a spectral theory of graphs based on the signless Laplacian, II. Linear Algebra Appl. 2010;432:2257–2272.
   Web of Science ®Google Scholar
• Fan YZ, Yang D. The signless Laplacian spectral radius of graphs with given number of pendant vertices. Graphs Combin. 2009;25:291–298.
   Web of Science ®Google Scholar
• Feng LH, Hu GH. On three conjectures involving the signless Laplacian spectral radius of graphs. Publ. Inst. Math. (Beograd). 2009;85:35–38.
   Google Scholar
• Hansen P, Lucas C. Bounds and conjectures for the signless Laplacian index of graphs. Linear Algebra Appl. 2010;432:3319–3336.
   Web of Science ®Google Scholar
• Hou YP, Li JS. Bounds on the largest eigenvalues of trees with a given size of matching. Linear Algebra Appl. 2002;324:203–217.
   Web of Science ®Google Scholar
• Hou AL, Li SC. Ordering n-vertex unicyclic graphs with matching number q by their signless Laplacian spectral radii. Submitted for publication.
   Google Scholar
• Li SC, Zhang MJ. On the signless Laplacian index of cacti with a given number of pendant vetices. Linear Algebra Appl. 2012;436:4400–4411.
   Web of Science ®Google Scholar
• Liu J, Liu B. The maximum clique and the signless Laplacian eigenvalues. Czechoslovak Math. J. 2008;58:1233–1240.
   Web of Science ®Google Scholar
• Oliveira CS, de Lima LS, de Abreu NMM, et al. Bounds on the Q-spread of a graph. Linear Algebra Appl. 2010;432:2342–2351.
   Web of Science ®Google Scholar
• Oliveira CS, de Lima LS, de Abreu NMM, et al. Bounds on the index of the signless Laplacian of a graph. Discrete Appl. Math. 2010;158:355–360.
   Web of Science ®Google Scholar
• You LH, Yang M, Li JX. Spectrum of a class of matrices and its applications. Submitted for publication
   Google Scholar
• Zhang XD. The signless Laplacian spectral radius of graphs with given degree sequences. Discrete Appl. Math. 2009;157:2928–2937.
   Web of Science ®Google Scholar
• Chang A. Bounds on the second largest eigenvalue of a tree with perfect matchings. Linear Algebra Appl. 1998;283:247–255.
   Web of Science ®Google Scholar
• Chang A. On the largest eigenvalue of a tree with perfect matching. Discrete Math. 2003;269:45–63.
   Web of Science ®Google Scholar
• Chang A, Tian F. On the spectral radius of unicyclic graphs with perfect matchings. Linear Algebra Appl. 2003;370:237–250.
   Web of Science ®Google Scholar
• Chang A, Tian F, Yu A. On the index of bicyclic graphs with perfect matchings. Discrete Math. 2004;283:51–59.
   Web of Science ®Google Scholar
• Feng LH, Yu GH, Zhang XD. Spectral radius of graphs with given matching number. Linear Algebra Appl. 2007;422:133–138.
   Web of Science ®Google Scholar
• Feng LH, Li Q, Zhang XD. Minimizing the Laplacian spectral radius of trees with given matching number. Linear Multilinear Algebra. 2007;55:199–207.
   Web of Science ®Google Scholar
• Geng XY, Li SC, Li SX. On the index of tricyclic graphs with perfect matchings. Linear Algebra Appl. 2009;431:2304–2316.
   Web of Science ®Google Scholar
• Geng XY, Li SC. On the spectral radius of tricyclic graphs with a maximum matching. Linear Algebra Appl. 2012;36:4043–4051.
   Web of Science ®Google Scholar
• Hou AL, Li SC. Ordering n-vertex cacti with matching number q by their spectral radii. Quaestiones Mathematicae. 2014;37:401–414.
   Web of Science ®Google Scholar
• Huang ZW, Deng HY, Simic SK. On the spectral radius of cactuses with perfect matching. Appl Anal. Discrete math. 2011;5:14–21.
   Web of Science ®Google Scholar
• Yu GH. On the maximal signless Laplacian spectral radius of graphs with given matching number. Proc. Japan Acad. Ser. A. 2008;84:163–166.
   Google Scholar
• Zhang JM, Huang TZ, Guo JM. On the signless Laplacian spectral radius of bicyclic graphs with perfect matchings. Sci. World J. 2014; Article ID 374501.
   Web of Science ®Google Scholar
• Zhang JM, Huang TZ, Guo JM. On the signless Laplacian spectral radius of unicyclic graphs with fixed matching number. Publ. Inst. Math. 2015;97:187–197.
   Google Scholar
• Balasubramanian K. Recent developments in tree-pruning methods and polynomials for cactus graphs and trees. Methods of mathematical chemistry (Galveston, TX, 1989). J. Math. Chem. 1990;4:89–102.
   Web of Science ®Google Scholar
• Bona M, Bousquet M, Labelle G, et al. Enumeration of m-ary cacti. Adv. Appl. Math. 2000;24:22–56.
   Web of Science ®Google Scholar
• Borovićanin B, Petrović M. On the index of cactuses with n vertices. Publ. Inst. Math. (Beograd). 2006;79:13–18.
   Google Scholar
• Geller D, Manvel B. Reconstruction of cacti. Canad. J. Math. 1969;21:1354–1360.
   Web of Science ®Google Scholar
• Khan N, Pal A, Pal M. Edge colouring of cactus graphs. Adv. Model. Optim. 2009;11:407–421.
   Google Scholar
• Li S, Yang H, Zhao Q. Sharp bounds on Zagreb indices of cacti with k pendent vertices. Filomat. 2012;26:1189–1200.
   Web of Science ®Google Scholar
• Lin AH, Luo R, Zha XY. A sharp lower bound of the Randić index of cacti with r pendants. Discrete Appl. Math. 2008;156:1725–1735.
   Web of Science ®Google Scholar
• Liu HQ, Lu M. A unified approach to extremal cacti for different indices. MATCH Commun. Math. Comput. Chem. 2007;58:183–194.
   Web of Science ®Google Scholar
• Liu Y. The Laplacian spread of cactuses. Discrete Math. Theor. Comput. Sci. 2010;12:35–40.
   Web of Science ®Google Scholar
• Lu M, Zhang LZ, Tian F. On the Randić index of cacti. MATCH Commun. Math. Comput. Chem. 2006;56:551–556.
   Web of Science ®Google Scholar
• Ma F, Deng H. On the sum-connectivity index of cacti. Math. Comput. Modell. 2011;54:497–507.
   Google Scholar
• Petrović M, Aleksić T, Simić V. On the least eigenvalue of cacti. Linear Algebra Appl. 2011;435:2357–2364.
   Web of Science ®Google Scholar
• Wu JC, Deng HY, Jiang Q. On the spectral radius of cacti with k-pendant vertices. Linear Multilinear Algebra. 2010;58:391–398.
   Web of Science ®Google Scholar
• Xing R, Zhou B. On least eigenvalues and least eigenvectors of real symmetric matrices and graphs. Linear Algebra Appl. 2013;438:2378–2384.
   Web of Science ®Google Scholar
• Zmazek B, Zerovnik J. The obnoxious center problem on weighted cactus graphs. The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW, 2001). Discrete Appl. Math. 2004;136:377–386.
   Web of Science ®Google Scholar
• Hong Y, Zhang XD. Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees. Discrete Math. 2005;296:187–197.
   Web of Science ®Google Scholar
• Liu C-a, Weng C-w. Spectral radius of bipartite graphs. Linear Algebra Appl. 2015;474:30–43.
   Google Scholar