The distance matrix of a bidirected tree
From MaRDI portal
Publication:3394463
DOI10.13001/1081-3810.1308zbMath1173.05339OpenAlexW1763833807MaRDI QIDQ3394463
Arbind Kumar Lal, Sukanta Pati, Ravindra B. Bapat
Publication date: 7 September 2009
Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/130732
Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (12)
Distance matrix of a class of completely positive graphs: determinant and inverse ⋮ The distance matrix of a tree with weights on its arcs ⋮ On mixed block graphs ⋮ Distance matrices of a tree: two more invariants, and in a unified framework ⋮ A \(q\)-analogue of distance matrix of block graphs ⋮ The exponential distance matrix of block graphs ⋮ The inverse of the distance matrix of a distance well-defined graph ⋮ Inverse of the distance matrix of a weighted cactoid digraph ⋮ Identities for minors of the Laplacian, resistance and distance matrices of graphs with arbitrary weights ⋮ Another simple proof of Graham and Pollak's theorem ⋮ Inverse of the distance matrix of a cactoid digraph ⋮ Distance matrix of weighted cactoid-type digraphs
This page was built for publication: The distance matrix of a bidirected tree
