Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph
Abstract 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 ∂1≥⋯≥∂n $\partial_{1}\geq\cdots\geq\partial_{n}$, ∂1L≥⋯≥∂nL $\partial_{1}^{L}\geq\cdots\geq\partial_{n}^{L}$ and ∂1Q≥⋯≥∂nQ $\partial_{1} ^{Q}\ge...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2018-04-01
|
| Series: | Journal of Inequalities and Applications |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1186/s13660-018-1663-5 |