An edge version of the matrix-tree theorem and the wiener index
From MaRDI portal
Publication:3211327
DOI10.1080/03081088908817955zbMath0723.05049OpenAlexW1994030344MaRDI QIDQ3211327
Publication date: 1989
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081088908817955
Related Items (27)
On topological indices for small RNA graphs ⋮ On the sum of all distances in composite graphs ⋮ Algebraic graph theory without orientation ⋮ On the Wiener index, distance cospectrality and transmission-regular graphs ⋮ Wiener number of vertex-weighted graphs and a chemical application ⋮ Applications of multlinear algebra ⋮ Continuous mean distance of a weighted graph ⋮ On the adjoint of a matrix associated with trees ⋮ Graph curvature via resistance distance ⋮ On the sum of the squares of all distances in bipartite graphs with given connectivity ⋮ Moore-penrose inverse of the incidence matrix of a tree ⋮ Hitting Times, Cover Cost, and the Wiener Index of a Tree ⋮ Unnamed Item ⋮ On the sum of all distances in bipartite graphs ⋮ On the geometry and Laplacian of a graph ⋮ Linear estimation in models based on a graph ⋮ Maximizing Wiener index for trees with given vertex weight and degree sequences ⋮ From ternary strings to Wiener indices of benzenoid chains ⋮ Unimodular equivalence of graphs ⋮ Laplace eigenvalues of graphs---a survey ⋮ A minimax-condition for the characteristic center of a tree ⋮ Connections between Wiener index and matchings ⋮ The distance spectrum of a tree ⋮ Coalescence, majorization, edge valuations and the laplacian spectra of graphs ⋮ Average distance in graphs and eigenvalues ⋮ Edge version of the matrix tree theorem for trees ⋮ Laplacian matrices of graphs: A survey
Cites Work
This page was built for publication: An edge version of the matrix-tree theorem and the wiener index
