Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees
From MaRDI portal
Publication:2235240
DOI10.1016/j.dam.2021.08.025zbMath1476.05115arXiv2008.06068OpenAlexW3196883690MaRDI QIDQ2235240
Alexander Veremyev, Mikhail Goubko
Publication date: 21 October 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.06068
Extremal problems in graph theory (05C35) Mixed integer programming (90C11) Matrix equations and identities (15A24) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)
Cites Work
- Degree-based topological indices: optimal trees with given number of pendents
- On Euclidean distance matrices
- Properties of Euclidean and non-Euclidean distance matrices
- Distance matrix polynomials of trees
- Multicommodity flow models for spanning trees with hop constraints
- Sum of weighted distances in trees
- Maximizing Wiener index for trees with given vertex weight and degree sequences
- On distance matrices and Laplacians
- New formulations and solution procedures for the hop constrained network design problem.
- Graphs with a given diameter that maximise the Wiener index
- Bounding the \(k\)-Steiner Wiener and Wiener-type indices of trees in terms of eccentric sequence
- A polyhedral study of the diameter constrained minimum spanning tree problem
- Optimum Communication Spanning Trees
- Lower bound for the cost of connecting tree with given vertex degree sequence
- Minimizing Wiener Index for Vertex-Weighted Trees with Given Weight and Degree Sequences
- On the Addressing Problem for Loop Switching
- Generalized inverse of the Laplacian matrix and some applications
- Squared distance matrix of a tree: inverse and inertia
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
