On the Laplacian coefficients of tricyclic graphs with prescribed matching number
Author(s) -
Jing Luo,
Runze Wan,
Zhongxun Zhu
Publication year - 2016
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1937
Subject(s) - combinatorics , mathematics , laplace operator , matching (statistics) , tricyclic , laplacian matrix , order (exchange) , square (algebra) , polynomial , characteristic polynomial , discrete mathematics , chemistry , graph , stereochemistry , mathematical analysis , geometry , statistics , finance , economics
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)
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom