Distance Matrix of a Class of Completely Positive Graphs: Determinant and Inverse

Joyentanuj Das, Sachindranath Jayaraman, Sumit Mohanty

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…