On the distance matrix of a directed graph

From MaRDI portal
Revision as of 09:25, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4137203

DOI10.1002/JGT.3190010116zbMath0363.05034OpenAlexW2008464768MaRDI QIDQ4137203

Alan J. Hoffman, Haruo Hosoya, Ronald L. Graham

Publication date: 1977

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190010116




Related Items (47)

Distance matrix of a multi-block graph: determinant and inverseComputing the determinant of the distance matrix of a bicyclic graphOn Cartesian product of Euclidean distance matrices\(q\)-analogs of distance matrices of 3-hypertreesGraph families with constant distance determinantOn some counting polynomials in chemistryProximity, remoteness and distance eigenvalues of a graphUnnamed ItemSemi-Lipschitz functions and machine learning for discrete dynamical systems on graphsOn mixed block graphsThe distance matrices of some graphs related to wheel graphsA note on distance matrices with unicyclic graph realizationsFinite metric spaces of strictly negative typeThe bipartite Laplacian matrix of a nonsingular treeDistance matrices of a tree: two more invariants, and in a unified frameworkA \(q\)-analogue of distance matrix of block graphsA class of graph-geodetic distances generalizing the shortest-path and the resistance distancesThe exponential distance matrix of block graphsOn the determinant of \(q\)-distance matrix of a graphUnnamed ItemUnnamed ItemInertia and distance energy of line graphs of unicyclic graphsOn Isometric Embeddings of GraphsThe determinant of the distance matrix of graphs with blocks at most bicyclicGain distance matrices for complex unit gain graphsThe class of \(q\)-cliqued graphs: eigen-bi-balanced characteristic, designs, and an entomological experimentThe determinants of \(q\)-distance matrices of trees and two quantities relating to permutationsThe bipartite distance matrix of a nonsingular treeThe inverse of the distance matrix of a distance well-defined graphDistance spectra of graphs: a surveyInverse of the distance matrix of a bi-block graphIdentities for minors of the Laplacian, resistance and distance matricesA simple proof of Graham and Pollak's theoremThe graph bottleneck identityOn a conjecture of Graham and Lovász about distance matricesInverse of the distance matrix of a weighted cactoid digraphDistance matrix polynomials of treesTHE SECOND IMMANANT OF SOME COMBINATORIAL MATRICESInverse of the distance matrix of a cycle-clique graphInverse of the distance matrix of a block graphThe 2-Steiner distance matrix of a treeAnother simple proof of Graham and Pollak's theoremOn spectra of distance Randić matrix of graphsA \(q\)-analogue of the bipartite distance matrix of a nonsingular treeFactoring distance matrix polynomialsInverse of the distance matrix of a cactoid digraphDistance matrix of weighted cactoid-type digraphs




Cites Work




This page was built for publication: On the distance matrix of a directed graph