Name
Abstract | ||
|---|---|---|
Let r >= 2 be an integer. A graph G=(V,E) is called r - partite if V admits a partition into r parts such that every edge has its ends in different parts. All of the r - partite graphs with given integer r consist of the class of multipartite graphs. Let G(r,n,D) be the set of multipartite graphs with r vertex parts, n nodes and diameter D. In this paper, we characterize the graphs with the maximum spectral radius in G(r,n,D). Furthermore, we show that the maximum spectral radius is not only a decreasing function on D, but also an increasing function on r. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.akcej.2020.01.006 | AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS |
Keywords | DocType | Volume |
Multipartite graph, diameter, spectral radius, chromatic number, 05C50 | Journal | 17 |
Issue | ISSN | Citations |
3 | 0972-8600 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jian Wu | 1 | 71 | 6.69 |
| Haixia Zhao | 2 | 0 | 0.34 |