Trees with minimal Laplacian coefficients

DOI10.1016/j.camwa.2010.01.047zbMath1193.05060OpenAlexW2039169612MaRDI QIDQ988244

Aleksandar Ilić

Publication date: 26 August 2010

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2010.01.047

zbMATH Keywords

matchingsLaplacian matrixWiener indexincidence energyLaplacian coefficients

Mathematics Subject Classification ID

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

Related Items

Some extremal properties of the multiplicatively weighted Harary index of a graph ⋮ Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree ⋮ On the Laplacian coefficients of tricyclic graphs with prescribed matching number ⋮ Degree distance of unicyclic graphs with given matching number ⋮ The signless Laplacian coefficients and the incidence energy of unicyclic graphs with given pendent vertices ⋮ Some graphs determined by their (signless) Laplacian spectra ⋮ Comparison between Kirchhoff index and the Laplacian-energy-like invariant ⋮ Modified hyper-Wiener index of trees ⋮ The coefficients of Laplacian characteristic polynomials of graphs ⋮ Several improved asymptotic normality criteria and their applications to graph polynomials ⋮ Laplacian coefficients of trees with a given bipartition ⋮ Edge-grafting transformations on the average eccentricity of graphs and their applications ⋮ On the Laplacian coefficients of graphs under some transformations ⋮ The signless Laplacian coefficients and incidence energy of bicyclic graphs ⋮ On incidence energy of graphs ⋮ On the (reverse) cover cost of trees with some given parameters ⋮ On the Laplacian coefficients of trees with a perfect matching ⋮ On the extremal total reciprocal edge-eccentricity of trees ⋮ Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications ⋮ Ordering trees with given matching number by their Wiener indices ⋮ Each \((n,m)\)-graph having the \(i\)-th minimal Laplacian coefficient is a threshold graph ⋮ On the Laplacian coefficients of unicyclic graphs with prescribed matching number ⋮ The Laplacian spectral radius of trees and maximum vertex degree ⋮ Ordering of trees with fixed matching number by the Laplacian coefficients ⋮ On the Laplacian coefficients of bicyclic graphs ⋮ On the Laplacian coefficients and Laplacian-like energy of bicyclic graphs ⋮ On the reformulated reciprocal sum-degree distance of graph transformations

Cites Work

• On incidence energy of a graph
• Starlike trees are determined by their Laplacian spectrum
• On the Laplacian coefficients of acyclic graphs
• Signless Laplacians of finite graphs
• On the minimal energy ordering of trees with perfect matchings
• On some forests determined by their Laplacian or signless Laplacian spectrum
• Trees with \(m\)-matchings and the fourth and fifth minimal Hosoya index
• On the Laplacian coefficients of unicyclic graphs
• Ordering trees by the Laplacian coefficients
• On acyclic conjugated molecules with minimal energies
• Average distance and independence number
• Bounds on the largest eigenvalues of trees with a given size of matching
• On acyclic systems with minimal Hosoya index
• Maximal Hosoya index and extremal acyclic molecular graphs without perfect matching
• The largest Hosoya index of \((n,n+1)\)-graphs
• Connections between Wiener index and matchings
• On Laplacian like energy of trees
• A connection between ordinary and Laplacian spectra of bipartite graphs
• Wiener index of trees: Theory and applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item