A \(q\)-analogue of the bipartite distance matrix of a nonsingular tree

DOI10.1016/j.disc.2022.113153zbMath1502.05132OpenAlexW4295883551WikidataQ114190450 ScholiaQ114190450MaRDI QIDQ2092377

Rakesh Jana

Publication date: 2 November 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2022.113153

zbMATH Keywords

treedeterminantdistance matrixbipartite distance matrix

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items

The bipartite Laplacian matrix of a nonsingular tree, Distance-regular graphs with exactly one positive \(q\)-distance eigenvalue

Cites Work

• Unnamed Item
• Unnamed Item
• Identities for minors of the Laplacian, resistance and distance matrices
• \(q\)-analogs of distance matrices of 3-hypertrees
• A \(q\)-analogue of Graham, Hoffman and Hosoya's theorem
• Inverses of trees
• Distance matrix polynomials of trees
• Inverses of bipartite graphs
• On distance matrices and Laplacians
• The bipartite distance matrix of a nonsingular tree
• A combinatorial formula for principal minors of a matrix with tree-metric exponents and its applications
• On the determinant of \(q\)-distance matrix of a graph
• The determinants of \(q\)-distance matrices of trees and two quantities relating to permutations
• A \(q\)-analogue of the distance matrix of a tree
• Determinant of the distance matrix of a tree with matrix weights
• A q-Analogue of the Addressing Problem of Graphs by Graham and Pollak
• On the distance matrix of a directed graph
• On the Addressing Problem for Loop Switching