Connections between Wiener index and matchings

DOI10.1007/s10910-005-9026-0zbMath1096.92068OpenAlexW2027807243MaRDI QIDQ2503738

Weigen Yan, Yeong-Nan Yeh

Publication date: 22 September 2006

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10910-005-9026-0

zbMATH Keywords

matchingLaplacian matrixWiener indexperfect Hosoya index

Mathematics Subject Classification ID

Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items

Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree, Graphs whose spectrum determined by non-constant coefficients, The behavior of Wiener indices and polynomials of graphs under five graph decorations, On the Laplacian coefficients of acyclic graphs, Combinatorial explanation of the weighted Wiener (Kirchhoff) index of trees and unicyclic graphs, On the number of \(k\)-matchings in graphs, Modified hyper-Wiener index of trees, On the signless Laplacian coefficients of unicyclic graphs, On the Laplacian coefficients of trees with a perfect matching, The determinants of \(q\)-distance matrices of trees and two quantities relating to permutations, The Hosoya polynomial decomposition for hexagonal chains, On the Laplacian coefficients of unicyclic graphs with prescribed matching number, Ordering of trees with fixed matching number by the Laplacian coefficients, Asymptotic normality of Laplacian coefficients of graphs, Trees with minimal Laplacian coefficients, On the Kirchhoff index of a unicyclic graph and the matchings of the subdivision, On the Laplacian coefficients and Laplacian-like energy of bicyclic graphs, Laplacian coefficients of trees with given number of leaves or vertices of degree two, On the matching polynomial of subdivision graphs, Laplacian coefficients and Zagreb indices of trees, On the Kirchhoff index of a graph and the matchings of the subdivision, Ordering trees by the Laplacian coefficients, On a Poset of Trees II

Cites Work

• Unnamed Item
• Unnamed Item
• From ternary strings to Wiener indices of benzenoid chains
• Eigenvalues, diameter, and mean distance in graphs
• Mean distance in a graph
• Zigging and zagging in pentachains
• An edge version of the matrix-tree theorem and the wiener index
• The distance spectrum of a tree
• A relation between the matching number and Laplacian spectrum of a graph
• Wiener index of trees: Theory and applications