×

On the Laplacian coefficients and Laplacian-like energy of unicyclic graphs with \(n\) vertices and \(m\) pendant vertices. (English) Zbl 1264.05082

Summary: Let \(\Phi(G, \lambda) = \det(\lambda I_n - L(G)) = \sum^n_{k=0}(-1)^k c_k(G)\lambda^{n-k}\) be the characteristic polynomial of the Laplacian matrix of a graph \(G\) of order \(n\).
In this paper, we give four transforms on graphs that decrease all Laplacian coefficients \(c_k(G)\) and investigate a conjecture A. Ilić and M. Ilić [Linear Algebra Appl. 431, No. 11, 2195–2202 (2009; Zbl 1194.05089)] about the Laplacian coefficients of unicyclic graphs with \(n\) vertices and \(m\) pendant vertices. Finally, we determine the graph with the smallest Laplacian-like energy among all the unicyclic graphs with \(n\) vertices and \(m\) pendant vertices.

MSC:

05C50 Graphs and linear algebra (matrices, eigenvalues, etc.)
05C31 Graph polynomials

Citations:

Zbl 1194.05089
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] D. M. Cvetković, M. Doob, and H. Sachs, Spectra of Graphs-Theory and Applications, Johann Ambrosius Barth, Heidelberg, Germany, 3rd edition, 1995. · Zbl 0915.90195 · doi:10.1016/0377-2217(95)00225-1
[2] B. Mohar, “On the Laplacian coefficients of acyclic graphs,” Linear Algebra and its Applications, vol. 422, no. 2-3, pp. 736-741, 2007. · Zbl 1120.05055 · doi:10.1016/j.laa.2006.12.005
[3] D. Stevanović and A. Ilić, “On the Laplacian coefficients of unicyclic graphs,” Linear Algebra and its Applications, vol. 430, no. 8-9, pp. 2290-2300, 2009. · Zbl 1226.05167 · doi:10.1016/j.laa.2008.12.006
[4] C.-X. He and H.-Y. Shan, “On the Laplacian coefficients of bicyclic graphs,” Discrete Mathematics, vol. 310, no. 23, pp. 3404-3412, 2010. · Zbl 1221.05234 · doi:10.1016/j.disc.2010.08.012
[5] A. Ilić and M. Ilić, “Laplacian coefficients of trees with given number of leaves or vertices of degree two,” Linear Algebra and its Applications, vol. 431, no. 11, pp. 2195-2202, 2009. · Zbl 1194.05089 · doi:10.1016/j.laa.2009.07.014
[6] A. Ilić, “On the ordering of trees by the Laplacian coefficients,” Linear Algebra and its Applications, vol. 431, no. 11, pp. 2203-2212, 2009. · Zbl 1194.05088 · doi:10.1016/j.laa.2009.07.022
[7] X.-D. Zhang, X.-P. Lv, and Y.-H. Chen, “Ordering trees by the Laplacian coefficients,” Linear Algebra and its Applications, vol. 431, no. 12, pp. 2414-2424, 2009. · Zbl 1175.05091 · doi:10.1016/j.laa.2009.04.018
[8] W. Lin and W. Yan, “Laplacian coefficients of trees with a given bipartition,” Linear Algebra and its Applications, vol. 435, no. 1, pp. 152-162, 2011. · Zbl 1226.05162 · doi:10.1016/j.laa.2011.01.011
[9] J. Liu and B. Liu, “A Laplacian-energy-like invariant of a graph,” MATCH. Communications in Mathematical and in Computer Chemistry, vol. 59, no. 2, pp. 397-419, 2008. · Zbl 1164.05044
[10] D. Stevanović, “Laplacian-like energy of trees,” MATCH. Communications in Mathematical and in Computer Chemistry, vol. 61, no. 2, pp. 407-417, 2009. · Zbl 1274.05304
[11] S.-W. Tan, “On the Laplacian coefficients of unicyclic graphs with prescribed matching number,” Discrete Mathematics, vol. 311, no. 8-9, pp. 582-594, 2011. · Zbl 1222.05216 · doi:10.1016/j.disc.2010.12.022
[12] A. Ilić, A. Ilić, and D. Stevanović, “On the Wiener index and Laplacian coefficients of graphs with given diameter or radius,” MATCH. Communications in Mathematical and in Computer Chemistry, vol. 63, no. 1, pp. 91-100, 2010. · Zbl 1265.05378
[13] A. K. Kelmans and V. M. Chelnokov, “A certain polynomial of a graph and graphs with an extremal number of trees,” Journal of Combinatorial Theory B, vol. 16, pp. 197-214, 1974. · Zbl 0277.05104 · doi:10.1016/0095-8956(74)90065-3
[14] B. Zhou and I. Gutman, “A connection between ordinary and Laplacian spectra of bipartite graphs,” Linear and Multilinear Algebra, vol. 56, no. 3, pp. 305-310, 2008. · Zbl 1163.05043 · doi:10.1080/03081080601002254
[15] I. Gutman, “The energy of a graph,” Berichte der Mathematisch-Statistischen Sektion im Forschungszentrum Graz, vol. 103, no. 100-105, pp. 1-22, 1978. · Zbl 0402.05040
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.