Laplacian coefficients of unicyclic graphs with the number of leaves and girth

preprint2013arXivOpen access

Abstract

Let GG be a graph of order nn and let L(G,λ)=∑k=0n(−1)kck(G)λn−k\mathcal{L}(G,λ)=\sum_{k=0}^n (-1)^{k}c_{k}(G)λ^{n-k} be the characteristic polynomial of its Laplacian matrix. Motivated by Ilić and Ilić's conjecture [A. Ilić, M. Ilić, Laplacian coefficients of trees with given number of leaves or vertices of degree two, Linear Algebra and its Applications 431(2009)2195-2202.] on all extremal graphs which minimize all the Laplacian coefficients in the set Un,l\mathcal{U}_{n,l} of all nn-vertex unicyclic graphs with the number of leaves ll, we investigate properties of the minimal elements in the partial set (Un,lg,⪯)(\mathcal{U}_{n,l}^g, \preceq) of the Laplacian coefficients, where Un,lg\mathcal{U}_{n,l}^g denote the set of nn-vertex unicyclic graphs with the number of leaves ll and girth gg. These results are used to disprove their conjecture. Moreover, the graphs with minimum Laplacian-like energy in Un,lg\mathcal{U}_{n,l}^g are also studied.

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.