On the Laplacian Coefficients of Tricyclic Graphs with Prescribed Matching Number

• Autorzy: Jing Luo , Zhongxun Zhu , Runze Wan
• Języki publikacji: EN

Abstrakty

EN

Let [...] φ(L(G))=det (xI−L(G))=∑k=0n(−1)kck(G)xn−k $\phi (L(G)) = \det (xI - L(G)) = \sum\nolimits_{k = 0}^n {( - 1)^k c_k (G)x^{n - k} } $ be the Laplacian characteristic polynomial of G. In this paper, we characterize the minimal graphs with the minimum Laplacian coefficients in 𝒢n,n+2(i) (the set of all tricyclic graphs with fixed order n and matching number i). Furthermore, the graphs with the minimal Laplacian-like energy, which is the sum of square roots of all roots on ϕ(L(G)), is also determined in 𝒢n,n+2(i).

Słowa kluczowe

EN

Laplacian characteristic polynomial; Laplacian-like energy; tricyclic graph

Kategorie tematyczne

• 05C12: Distance in graphs
• 05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2017
• Tom: 37
• Numer: 3
• Strony: 505-522

Daty

wydano

2017-08-01

otrzymano

2015-11-27

poprawiono

2016-04-01

zaakceptowano

2016-05-04

online

2017-07-06

Twórcy

autor

Jing Luo

• , , , P.R.

autor

Zhongxun Zhu

• , , , P.R.

autor

Runze Wan

• , , , P.R.

Identyfikatory

DOI

10.7151/dmgt.1937