A \(q\)-analogue of distance matrix of block graphs

DOI10.1016/j.aam.2023.102548zbMath1517.05112OpenAlexW4376651307MaRDI QIDQ6107826

Zhibin Du, Rundan Xing

Publication date: 3 July 2023

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2023.102548

zbMATH Keywords

determinantinverseblock graphsdistance matrix\(q\)-analogue of distance matrix

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Combinatorial aspects of block designs (05B05) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph designs and isomorphic decomposition (05C51)

Cites Work

• Inverse of the distance matrix of a cycle-clique graph
• Another simple proof of Graham and Pollak's theorem
• \(q\)-analogs of distance matrices of 3-hypertrees
• A \(q\)-analogue of Graham, Hoffman and Hosoya's theorem
• On the distance matrix of a tree
• Distance matrix polynomials of trees
• On distance matrices and Laplacians
• The determinant of the distance matrix of graphs with blocks at most bicyclic
• Inverse of the distance matrix of a cactoid digraph
• 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 simple proof of Graham and Pollak's theorem
• Inverse of the distance matrix of a block graph
• The distance matrix of a bidirected tree
• On the distance matrix of a directed graph
• On the Addressing Problem for Loop Switching

This page was built for publication: A \(q\)-analogue of distance matrix of block graphs