An inverse formula for the distance matrix of a fan graph
From MaRDI portal
Publication:6039182
DOI10.1080/03081087.2021.2011827zbMath1518.05120OpenAlexW4200611395MaRDI QIDQ6039182
Unnamed Author, Licheng Zhang, Shuchao Li
Publication date: 3 May 2023
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2021.2011827
Related Items (1)
Cites Work
- Unnamed Item
- The distance matrices of some graphs related to wheel graphs
- The inverse of the distance matrix of a distance well-defined graph
- Inverse of the distance matrix of a cycle-clique graph
- Resistance distance and the normalized Laplacian spectrum
- Methods for constructing distance matrices and the inverse eigenvalue problem
- Distance matrix polynomials of trees
- On distance matrices of helm graphs obtained from wheel graphs with an even number of vertices
- On the resistance distance and Kirchhoff index of a linear hexagonal (cylinder) chain
- Two-point resistances in the generalized phenylenes
- An inverse formula for the distance matrix of a wheel graph with an even number of vertices
- Inverse of the distance matrix of a weighted cactoid digraph
- Inverse of the distance matrix of a cactoid digraph
- Inverse of the distance matrix of a block graph
- On the Addressing Problem for Loop Switching
- Inverse of the distance matrix of a bi-block graph
- Distance matrix of a multi-block graph: determinant and inverse
This page was built for publication: An inverse formula for the distance matrix of a fan graph