Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees

DOI10.1016/j.dam.2021.08.025zbMath1476.05115arXiv2008.06068MaRDI 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

zbMATH Keywords

matrix equation; Wiener index; mixed-integer programming; extremal graph theory; optimal tree problem

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

90C11: Mixed integer programming

15A24: Matrix equations and identities

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C12: Distance in graphs

05C09: Graphical indices (Wiener index, Zagreb index, Randi? index, etc.)