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

DOI10.1016/j.laa.2009.04.020zbMath1175.05037MaRDI 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

determinant; trees; uniform hypergraphs; distance matrix; \(q\)-analog; Pfaffian identity

Mathematics Subject Classification ID

05C05: Trees

15A09: Theory of matrix inversion and generalized inverses

05C65: Hypergraphs

15A15: Determinants, permanents, traces, other special matrix functions

15A24: Matrix equations and identities

Related Items

Inverse of the distance matrix of a bi-block graph, The inverse of the distance matrix of a distance well-defined graph, Identities for minors of the Laplacian, resistance and distance matrices, Distance spectral radius of uniform hypergraphs, Inverse of the distance matrix of a cycle-clique graph, Inverse of the distance matrix of a cactoid digraph, Spectral radius of uniform hypergraphs, Distance (signless) Laplacian spectral radius of uniform hypergraphs, Inverse of the distance matrix of a block graph

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