Name
Abstract | ||
|---|---|---|
Suppose that the vertex set of a graph G is V(G) = {v(1), ..., v(n)}. Then we denote by Tr-G(v(i)) the sum of distances between v(i) and all other vertices of G. Let Tr(G) be the n x n diagonal matrix with its (i, i)-entry equal to Tr-G(v(i)) and D(G) be the distance matrix of G. Then L-D(G) = Tr(G) - D(G) is the distance Laplacian matrix of G. The largest eigen-values of D(G) and L-D(G) are called distance spectral and distance Laplacian spectral radius of G, respectively. In this paper we describe the unique graph with distance and distance Laplacian spectral radius among all connected graphs of order n with given cut edges. |
Year | Venue | Keywords |
|---|---|---|
2016 | ARS COMBINATORIA | Spectral radius,cut edges |
Field | DocType | Volume |
Graph,Discrete mathematics,Combinatorics,Spectral radius,Mathematics,Laplace operator | Journal | 125 |
ISSN | Citations | PageRank |
0381-7032 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dandan Fan | 1 | 2 | 2.60 |
| Aihong Niu | 2 | 2 | 1.93 |
| Guoping Wang | 3 | 488 | 63.02 |