Advanced search
Publication Cover
Linear and Multilinear Algebra Volume 65, 2017 - Issue 5
Submit an article Journal homepage
219
Views
2
CrossRef citations to date
0
Altmetric
Articles

The (signless) Laplacian spectral radii of c-cyclic graphs with n vertices, girth g and k pendant vertices

Muhuo LiuDepartment of Mathematics, South China Agricultural University, Guangzhou, China.View further author information
,
Kinkar Ch. DasDepartment of Mathematics, Sungkyunkwan University, Suwon, Republic of Korea.View further author information
&
Hong-Jian LaiDepartment of Mathematics, West Virginia University, Morgantown, WV, USA.Correspondence[email protected]
View further author information
Pages 869-881 | Received 03 Mar 2016, Accepted 05 Jul 2016, Published online: 01 Aug 2016

References

  • Borovićanin B, Petrović M. On the index of cactuses with n vertices. Publ. Inst. Math. Beograd. 2006;79:13–18.
  • Merris R. Laplacian matrices of graphs: a survey. Linear Algebra Appl. 1994;197–198:143–176.
  • Li K, Wang L, Zhao G. The signless Laplacian spectral radius of tricyclic graphs and trees with k pendant vertices. Linear Algebra Appl. 2011;435:811–822.
  • Zhang X-D. The Laplacian spectral radii of trees with degree sequences. Discrete Math. 2008;308:3143–3150.
  • Liu M, Tan X, Liu B. The (signless) Laplacian spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices. Czech. Math. J. 2010;60:849–867.
  • Zhang X-D. The signless Laplacian spectral radius of graphs with given degree sequences. Discrete Appl. Math. 2009;157:2928–2937.
  • Guo J-M. The Laplacian spectral radii of unicyclic and bicyclic graphs with n vertices and k pendant vertices. Sci. China Math. 2010;53:2135–2142.
  • Feng L. The signless Laplacian spectral radius for bicyclic graphs with k pendant vertices. Kyungpook Math. J. 2010;50:109–116.
  • Liu M, Tan X, Liu B. The largest signless Laplacian spectral radius of connected bicyclic and tricyclic graphs with n vertices and k pendant vertices. Appl. Math. J. Chinese Univ. Ser. A. 2011;26:215–222. Chinese.
  • Huang Y, Liu B, Liu Y. The signless Laplacian spectral radius of bicyclic graphs with prescribed degree sequences. Discrete Math. 2011;311:504–511.
  • Zhang J, Guo J-M. The signless Laplacian spectral radius of tricyclic graphs with k pendant vertices. J. Math. Res. Appl. 2012;32:281–287.
  • Guo S-G, Wang Y-F. The Laplacian spectral radius of tricyclic graphs with n vertices and k pendant vertices. Linear Algebra Appl. 2009;431:139–147.
  • Liu M. The (signless) Laplacian spectral radii of c-cyclic graphs with n vertices and k pendant vertices. Electron. J. Linear Algebra. 2012;23:942–952.
  • Liu H, Lu M, Zhang S. On the (Laplacian) spectral radius of unicyclic graphs with girth g and k pendant vertices. Sci. Sin. Math. 2010;40:1017–1024. Chinese.
  • Li K, Wang L, Zhao G. The signless Laplacian spectral radius of unicyclic and bicyclic graphs with a given girth. Electron. J. Combin. 2011;18: p.183.
  • Zhai M, Yu G, Shu J. The Laplacian spectral radius of bicyclic graphs with a given girth. Comput. Math. Appl. 2010;59:376–381.
  • Zhu Z. The signless Laplacian spectral radius of bicyclic graphs with a given girth. Electron. J. Linear Algebra. 2011;22:378–388.
  • Lu Q, Wang L. The signless Laplacian spectral radius of tricyclic graphs with a given girth. J. Math. Res. Appl. 2014;34:379–391.
  • Pan Y-L. Sharp upper bounds for the Laplacian graph eigenvalues. Linear Algebra Appl. 2002;355:287–295.
  • Horn RA, Johnson CR. Matrix analysis. New York (NY): Cambridge University Press; 1990.
  • Das KC. The Laplacian spectrum of a graph. Comput. Math. Appl. 2004;48:715–724.
  • Guo J-M. The Laplacian spectral radius of a graph under perturbation. Comput. Appl. Math. 2007;54:709–720.
  • Das KC. An improved upper bound for Laplacian graph eigenvalues. Linear Algebra Appl. 2003;368:269–278.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.