Name
Abstract | ||
|---|---|---|
The eccentricity matrix epsilon(G) of a graph G is derived from the corresponding distance matrix by keeping only the largest non-zero elements for each row and each column and leaving zeros for the remaining ones. The epsilon-eigenvalues of a graph G are those of its eccentricity matrix, in which the maximum modulus is called the epsilon-spectral radius. In this paper, we first establish the relationship between the majorization and epsilon-spectral radii of complete multipartite graphs. As applications, the extremal complete multipartite graphs having the minimum and maximum epsilon-spectral radii are determined. Furthermore, we study the multiplicities of epsilon-eigenvalues among complete multipartite graphs and identify all complete multipartite graphs with distinct epsilon-eigenvalues. (C) 2022 Elsevier Inc. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1016/j.amc.2022.127036 | APPLIED MATHEMATICS AND COMPUTATION |
Keywords | DocType | Volume |
Eccentricity matrix, epsilon-spectrum, Majorization, Multiplicity | Journal | 424 |
ISSN | Citations | PageRank |
0096-3003 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wei Wei | 1 | 22 | 20.02 |
| Shuchao Li | 2 | 183 | 35.15 |