q-analogs of distance matrices of 3-hypertrees
DOI10.1016/J.LAA.2009.04.020zbMATH Open1175.05037OpenAlexW2091061057MaRDI QIDQ837003FDOQ837003
Authors: Sivaramakrishnan Sivasubramanian 
Publication date: 10 September 2009
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2009.04.020
Recommendations
Trees (05C05) Theory of matrix inversion and generalized inverses (15A09) Determinants, permanents, traces, other special matrix functions (15A15) Hypergraphs (05C65) Matrix equations and identities (15A24)
Cites Work
- Title not available (Why is that?)
- On the Addressing Problem for Loop Switching
- Distance matrix polynomials of trees
- A \(q\)-analogue of the distance matrix of a tree
- A simple proof of Graham and Pollak's theorem
- On the distance matrix of a directed graph
- Nonintersecting paths, pfaffians, and plane partitions
- Dodgon's determinant-evaluation rule proved by TWO-TIMING MEN and WOMEN
- Note on the Pfaffian matrix-tree theorem
Cited In (26)
- Inverse of the distance matrix of a bi-block graph
- On least distance eigenvalue of uniform hypergraphs
- Spectral radius of uniform hypergraphs
- Distance (signless) Laplacian spectral radius of uniform hypergraphs
- Identities for minors of the Laplacian, resistance and distance matrices
- Distance spectral radii of \(k\)-uniform hypertrees with fixed diameter
- A \(q\)-analogue of Graham, Hoffman and Hosoya's theorem
- Inverse of the distance matrix of a cactoid digraph
- Minimizing the distance spectral radius of uniform hypertrees with given parameters
- On the distance energy of \(k\)-uniform hypergraphs
- Inverses of \(q\)-distance matrices of a tree
- Inverse of the distance matrix of a block graph
- Distance spectral radii of k-uniform bicyclic hypergraphs
- A proof of a conjecture on the distance spectral radius
- Distance matrices of a tree: two more invariants, and in a unified framework
- Distance spectral radii of \(k\)-uniform hypertrees with given parameters
- A \(q\)-analogue of the distance matrix of a tree
- A \(q\)-analogue of distance matrix of block graphs
- The inverse of the distance matrix of a distance well-defined graph
- Distance (signless) Laplacian eigenvalues of \(k\)-uniform hypergraphs
- Inverse of the distance matrix of a cycle-clique graph
- On distance spectral radius of uniform hypergraphs with cycles
- The exponential distance matrix of block graphs
- A \(q\)-analogue of the bipartite distance matrix of a nonsingular tree
- Extremal properties of the distance spectral radius of hypergraphs
- Distance-regular graphs with exactly one positive \(q\)-distance eigenvalue
This page was built for publication: \(q\)-analogs of distance matrices of 3-hypertrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q837003)
