Distance matrix of a class of completely positive graphs: determinant and inverse

DOI10.1515/SPMA-2020-0109zbMATH Open1452.05047arXiv1906.04636OpenAlexW3036983409MaRDI QIDQ828089FDOQ828089

Authors: Joyentanuj Das, Sachindranath Jayaraman, Sumit Mohanty 

Publication date: 14 January 2021

Published in: Special Matrices (Search for Journal in Brave)

Abstract: A real symmetric matrix $A$ is said to be completely positive if it can be written as $B{B}^t$ for some (not necessarily square) nonnegative matrix $B$. A simple graph $G$ is called a completely positive graph if every doubly nonnegative matrix realization of $G$ is a completely positive matrix. Our aim in this manuscript is to compute the determinant and inverse (when it exists) of the distance matrix of a class of completely positive graphs. Similar to trees, we obtain a relation for the inverse of the distance matrix of a class of completely positive graphs involving the Laplacian matrix, a rank one matrix and a matrix $mathcalR$. We also determine the eigenvalues of some principal submatrices of matrix $mathcalR$.

Full work available at URL: https://arxiv.org/abs/1906.04636

Recommendations

• Distance matrix of a multi-block graph: determinant and inverse
• scientific article; zbMATH DE number 1292546
• On distance matrices and Laplacians
• The inverse of the distance matrix of a distance well-defined graph
• A note on completely positive graphs

zbMATH Keywords

Laplacian matrixdistance matrixSchur complementcompletely positive graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Cites Work

• On the Addressing Problem for Loop Switching
• Distance matrix polynomials of trees
• A \(q\)-analogue of the distance matrix of a tree
• The distance matrix of a tree with weights on its arcs
• The distance matrix of a bidirected tree
• Title not available (Why is that?)
• Inverse of the distance matrix of a cactoid digraph
• Inverse of the distance matrix of a block graph
• Graphs and matrices
• Inverse of the distance matrix of a bi-block graph

Cited In (5)

• On the determinant of \(q\)-distance matrix of a graph
• Distance matrix of a multi-block graph: determinant and inverse
• Title not available (Why is that?)
• An inverse formula for the distance matrix of a wheel graph with an even number of vertices
• Distance matrix of weighted cactoid-type digraphs

This page was built for publication: Distance matrix of a class of completely positive graphs: determinant and inverse

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828089)