A q-analogue of Graham, Hoffman and Hosoya's theorem
Summary: \textit{R.L. Graham}, \textit{A.J. Hoffman}, and \textit{H. Hosoya} [``On the distance matrix of a directed graph, J. Graph Theory 1, 85--88 (1977; Zbl 0363.05034)] gave a very nice formula about the determinant of the distance matrix \(D_G\) of a graph \(G\) in terms of the distance matrix of its blocks. We generalize this result to a \(q\)-analogue of \(D_G\). Our generalization yields results about the equality of the determinant of the mod-2 (and in general mod-\(k\)) distance matrix (i.e. each entry of the distance matrix is taken modulo 2 or \(k\)) of some graphs. The mod-2 case can be interpreted as a determinant equality result for the adjacency matrix of some graphs.
- Distance matrices of subsets of the Hamming cube
- The 2-Steiner distance matrix of a tree
- A q-analogue of the bipartite distance matrix of a nonsingular tree
- On the determinant of \(q\)-distance matrix of a graph
- A simple proof of Graham and Pollak's theorem
- A q -Analogue of the Jantzen-Schaper Theorem
- The second immanant of some combinatorial matrices
- Distance matrices of a tree: two more invariants, and in a unified framework
- scientific article; zbMATH DE number 7692338 (Why is no real title available?)
- A q-analogue of distance matrix of block graphs
- Distance-regular graphs with exactly one positive q-distance eigenvalue
- Extensions of the Graham-Hoffman-Hosoya type theorems for the exponential distance matrices and q-distance matrices
- A q -analogue of the distance matrix of a tree with matrix weights
- Inverses of \(q\)-distance matrices of a tree
- Another simple proof of Graham and Pollak's theorem
- \(q\)-analogs of distance matrices of 3-hypertrees
This page was built for publication: A \(q\)-analogue of Graham, Hoffman and Hosoya's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976674)
