| Autor: |
Guifu Su, Guanbang Song, Jun Yin, Junfeng Du |
| Jazyk: |
angličtina |
| Rok vydání: |
2022 |
| Předmět: |
|
| Zdroj: |
Symmetry, Vol 14, Iss 5, p 899 (2022) |
| Druh dokumentu: |
article |
| ISSN: |
2073-8994 |
| DOI: |
10.3390/sym14050899 |
| Popis: |
It is a well-known fact that a graph of diameter d has at least d+1 eigenvalues. A graph is d-extremal (resp. dα-extremal) if it has diameter d and exactly d+1 distinct eigenvalues (resp. α-eigenvalues), and a graph is split if its vertex set can be partitioned into a clique and a stable set. Such graphs have a diameter of at most three. If all vertex degrees in a split graph are either d˜ or d^, then we say it is (d˜,d^)-bidegreed. In this paper, we present a complete classification of the connected bidegreed 3α-extremal split graphs using the association of split graphs with combinatorial designs. This result is a natural generalization of Theorem 4.6 proved by Goldberg et al. and Proposition 3.8 proved by Song et al., respectively. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
|
Nepřihlášeným uživatelům se plný text nezobrazuje |
K zobrazení výsledku je třeba se přihlásit.
|
