Some properties of the distance Laplacian eigenvalues of a graph /
The distance Laplacian of a connected graph $G$ is defined by $\mathcal{L} = Diag(Tr)- \mathcal{D}$, where $\mathcal{D}$ is the distance matrix of $G$, and $ Diag(Tr)$ is the diagonal matrix whose main entries are the vertex transmissions in $G$. The spectrum of $\mathcal{L}$ is called the distance...
| Hlavní autor: |
Aouchiche, Mustapha
(
Autor )
|
|---|---|
| Další autoři: |
Hansen, Pierre
(
Autor )
|
| Typ dokumentu: | Článek |
| Jazyk: |
angličtina |
| ISSN: | 0011-4642 |
| Zdroj: | Czechoslovak mathematical journal: Vol. 64, no. 3 (2014), s. 751-761. |
| Předmět: | |
| Externí odkaz: |
Plný text Plný text 
|