On the distance matrix of a directed graph

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

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Directed graphs (digraphs), tournaments (05C20)

Related Items

Distance matrix of a multi-block graph: determinant and inverse, Computing the determinant of the distance matrix of a bicyclic graph, On Cartesian product of Euclidean distance matrices, \(q\)-analogs of distance matrices of 3-hypertrees, Graph families with constant distance determinant, On some counting polynomials in chemistry, Proximity, remoteness and distance eigenvalues of a graph, Unnamed Item, Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs, On mixed block graphs, The distance matrices of some graphs related to wheel graphs, A note on distance matrices with unicyclic graph realizations, Finite metric spaces of strictly negative type, The bipartite Laplacian matrix of a nonsingular tree, Distance matrices of a tree: two more invariants, and in a unified framework, A \(q\)-analogue of distance matrix of block graphs, A class of graph-geodetic distances generalizing the shortest-path and the resistance distances, The exponential distance matrix of block graphs, On the determinant of \(q\)-distance matrix of a graph, Unnamed Item, Unnamed Item, Inertia and distance energy of line graphs of unicyclic graphs, On Isometric Embeddings of Graphs, The determinant of the distance matrix of graphs with blocks at most bicyclic, Gain distance matrices for complex unit gain graphs, The class of \(q\)-cliqued graphs: eigen-bi-balanced characteristic, designs, and an entomological experiment, The determinants of \(q\)-distance matrices of trees and two quantities relating to permutations, The bipartite distance matrix of a nonsingular tree, The inverse of the distance matrix of a distance well-defined graph, Distance spectra of graphs: a survey, Inverse of the distance matrix of a bi-block graph, Identities for minors of the Laplacian, resistance and distance matrices, A simple proof of Graham and Pollak's theorem, The graph bottleneck identity, On a conjecture of Graham and Lovász about distance matrices, Inverse of the distance matrix of a weighted cactoid digraph, Distance matrix polynomials of trees, THE SECOND IMMANANT OF SOME COMBINATORIAL MATRICES, Inverse of the distance matrix of a cycle-clique graph, Inverse of the distance matrix of a block graph, The 2-Steiner distance matrix of a tree, Another simple proof of Graham and Pollak's theorem, On spectra of distance Randić matrix of graphs, A \(q\)-analogue of the bipartite distance matrix of a nonsingular tree, Factoring distance matrix polynomials, Inverse of the distance matrix of a cactoid digraph, Distance matrix of weighted cactoid-type digraphs

Cites Work

• On the Addressing Problem for Loop Switching