Distance matrix of a class of completely positive graphs: determinant and inverse
From MaRDI portal
Publication:828089
DOI10.1515/spma-2020-0109zbMath1452.05047arXiv1906.04636OpenAlexW3036983409MaRDI QIDQ828089
Sachindranath Jayaraman, Sumit Mohanty, Joyentanuj Das
Publication date: 14 January 2021
Published in: Special Matrices (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.04636
Related Items (2)
Distance matrix of a multi-block graph: determinant and inverse ⋮ Distance matrix of weighted cactoid-type digraphs
Cites Work
- Unnamed Item
- The distance matrix of a tree with weights on its arcs
- Distance matrix polynomials of trees
- Inverse of the distance matrix of a cactoid digraph
- 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 Addressing Problem for Loop Switching
- Inverse of the distance matrix of a bi-block graph
- Graphs and matrices
This page was built for publication: Distance matrix of a class of completely positive graphs: determinant and inverse