On the maximum spectral radius of multipartite graphs
Let be an integer. A graph 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 be the set of multipartite graphs with r vertex parts, n nod...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-09-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2020.01.006 |