\(q\)-analogs of distance matrices of 3-hypertrees

DOI10.1016/j.laa.2009.04.020zbMath1175.05037OpenAlexW2091061057MaRDI QIDQ837003

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

determinanttreesuniform hypergraphsdistance matrix\(q\)-analogPfaffian identity

Mathematics Subject Classification ID

Trees (05C05) Theory of matrix inversion and generalized inverses (15A09) Hypergraphs (05C65) Determinants, permanents, traces, other special matrix functions (15A15) Matrix equations and identities (15A24)

Related Items (23)

Spectral radius of uniform hypergraphs ⋮ Distance (signless) Laplacian spectral radius of uniform hypergraphs ⋮ Distance spectral radii of k-uniform bicyclic hypergraphs ⋮ Unnamed Item ⋮ On the distance energy of \(k\)-uniform hypergraphs ⋮ Distance matrices of a tree: two more invariants, and in a unified framework ⋮ Minimizing the distance spectral radius of uniform hypertrees with given parameters ⋮ A \(q\)-analogue of distance matrix of block graphs ⋮ Distance-regular graphs with exactly one positive \(q\)-distance eigenvalue ⋮ A proof of a conjecture on the distance spectral radius ⋮ On distance spectral radius of uniform hypergraphs with cycles ⋮ The exponential distance matrix of block graphs ⋮ On least distance eigenvalue of uniform hypergraphs ⋮ The inverse of the distance matrix of a distance well-defined graph ⋮ Inverse of the distance matrix of a bi-block graph ⋮ Identities for minors of the Laplacian, resistance and distance matrices ⋮ Distance spectral radii of k-uniform hypertrees with given parameters ⋮ Distance spectral radius of uniform hypergraphs ⋮ Inverse of the distance matrix of a cycle-clique graph ⋮ Inverse of the distance matrix of a block graph ⋮ A \(q\)-analogue of the bipartite distance matrix of a nonsingular tree ⋮ Distance (signless) Laplacian eigenvalues of \(k\)-uniform hypergraphs ⋮ Inverse of the distance matrix of a cactoid digraph

Cites Work

• Unnamed Item
• 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
• 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
• On the Addressing Problem for Loop Switching

This page was built for publication: \(q\)-analogs of distance matrices of 3-hypertrees