q-analogs of distance matrices of 3-hypertrees

DOI10.1016/J.LAA.2009.04.020MaRDI QIDQ837003zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

treesdeterminantdistance matrixuniform hypergraphs\(q\)-analogPfaffian identity

Mathematics Subject Classification ID

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)

Recommendations

• Inverses of \(q\)-distance matrices of a tree
• A \(q\)-analogue of the distance matrix of a tree
• A \(q\)-analogue of Graham, Hoffman and Hosoya's theorem
• A \(q\)-analogue of the bipartite distance matrix of a nonsingular tree
• A \(q\)-analogue of distance matrix of block graphs

Cites work

• scientific article; zbMATH DE number 1460605 (Why is no real title available?)
• A \(q\)-analogue of the distance matrix of a tree
• A simple proof of Graham and Pollak's theorem
• Distance matrix polynomials of trees
• Dodgon's determinant-evaluation rule proved by TWO-TIMING MEN and WOMEN
• Nonintersecting paths, pfaffians, and plane partitions
• Note on the Pfaffian matrix-tree theorem
• On the Addressing Problem for Loop Switching
• On the distance matrix of a directed graph

Cited in

(26)

• Extremal properties of the distance spectral radius of hypergraphs
• Distance-regular graphs with exactly one positive \(q\)-distance eigenvalue
• On least distance eigenvalue of uniform hypergraphs
• Inverse of the distance matrix of a bi-block graph
• Spectral radius of uniform hypergraphs
• Identities for minors of the Laplacian, resistance and distance matrices
• Distance (signless) Laplacian spectral radius of uniform hypergraphs
• A \(q\)-analogue of Graham, Hoffman and Hosoya's theorem
• Distance spectral radii of \(k\)-uniform hypertrees with fixed diameter
• 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

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)