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

DOI10.2298/AADM140715008ZzbMath1464.05259arXiv1311.1987MaRDI QIDQ2969175

Jie Zhang, Xiao Dong Zhang

Publication date: 14 March 2017

Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.1987

zbMATH Keywords

unicyclic graphLaplacian coefficientsLaplacian-like energybalanced starlike tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (3)

The signless Laplacian coefficients and the incidence energy of unicyclic graphs with given pendent vertices ⋮ Each \((n,m)\)-graph having the \(i\)-th minimal Laplacian coefficient is a threshold graph ⋮ On the characteristic polynomial of the power of a path.

This page was built for publication: Laplacian coefficients of unicyclic graphs with the number of leaves and girth