The exponential distance matrix of block graphs
From MaRDI portal
Publication:2698198
DOI10.1016/j.amc.2022.127673OpenAlexW4310366005MaRDI QIDQ2698198
Publication date: 21 April 2023
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2022.127673
Theory of matrix inversion and generalized inverses (15A09) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Cites Work
- Distance spectral radius of uniform hypergraphs
- Inverse of the distance matrix of a cycle-clique graph
- \(q\)-analogs of distance matrices of 3-hypertrees
- On the distance matrix of a tree
- Distance matrix polynomials of trees
- On distance matrices and Laplacians
- Inverse of the distance matrix of a cactoid digraph
- The determinants of \(q\)-distance matrices of trees and two quantities relating to permutations
- A \(q\)-analogue of the distance matrix of a tree
- 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 spectral closeness and residual spectral closeness of graphs
- On the Addressing Problem for Loop Switching
This page was built for publication: The exponential distance matrix of block graphs