Cargando…
Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph
Let G be a connected graph of order n. The remoteness of G, denoted by ρ, is the maximum average distance from a vertex to all other vertices. Let [Formula: see text] , [Formula: see text] and [Formula: see text] be the distance, distance Laplacian and distance signless Laplacian eigenvalues of G, r...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer International Publishing
2018
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5882757/ https://www.ncbi.nlm.nih.gov/pubmed/29628745 http://dx.doi.org/10.1186/s13660-018-1663-5 |