| Autor: |
Das Joyentanuj, Jayaraman Sachindranath, Mohanty Sumit |
| Jazyk: |
angličtina |
| Rok vydání: |
2020 |
| Předmět: |
|
| Zdroj: |
Special Matrices, Vol 8, Iss 1, Pp 160-171 (2020) |
| Druh dokumentu: |
article |
| ISSN: |
2300-7451 |
| DOI: |
10.1515/spma-2020-0109 |
| Popis: |
A real symmetric matrix A is said to be completely positive if it can be written as BBt for some (not necessarily square) nonnegative matrix B. A simple graph G is called a completely positive graph if every matrix realization of G that is both nonnegative and positive semidefinite 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. We compute a matrix such that the inverse of the distance matrix of a class of completely positive graphs is expressed a linear combination of the Laplacian matrix, a rank one matrix of all ones and . This expression is similar to the existing result for trees. We also bring out interesting spectral properties of some of the principal submatrices of . |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
