Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree

DOI10.1007/s10878-015-9977-4zbMath1336.05067arXiv1512.01333OpenAlexW2255929400MaRDI QIDQ266078

Yeong-Nan Yeh, Ya-Lei Jin, Xiao Dong Zhang

Publication date: 13 April 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

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

zbMATH Keywords

treematching polynomialincidence energyLaplacian coefficientsubdivision tree

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Related Items (6)

The signless Laplacian coefficients and the incidence energy of unicyclic graphs with given pendent vertices ⋮ The signless Laplacian coefficients and the incidence energy of graphs with a given bipartition ⋮ Several improved asymptotic normality criteria and their applications to graph polynomials ⋮ The signless Laplacian coefficients and the incidence energy of the graphs without even cycles ⋮ Extremal trees with fixed degree sequence ⋮ Asymptotic normality of Laplacian coefficients of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Laplacian coefficients of unicyclic graphs with prescribed matching number
• Maxima and minima of the Hosoya index and the Merrifield-Simmons index
• On the ordering of trees by the Laplacian coefficients
• The energy of graphs and matrices
• On the Laplacian coefficients of acyclic graphs
• The Laplacian spectral radii of trees with degree sequences
• Trees with minimal Laplacian coefficients
• On the Laplacian coefficients of unicyclic graphs
• Chemical trees minimizing energy and Hosoya index
• Ordering trees by the Laplacian coefficients
• Wiener index versus maximum degree in trees
• Superdominance order and distance of trees with bounded maximum degree
• Connections between Wiener index and matchings
• Largest Number of Subtrees of Trees with a Given Maximum Degree
• A connection between ordinary and Laplacian spectra of bipartite graphs
• Maximizing the number of independent subsets over trees with bounded degree

This page was built for publication: Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree