期刊论文

Li, Shuchao

英文

Journal of Combinatorial Designs

1063-8539

2020

28

11

763-782

10.1002/jcd.21743

The authors would like to express their sincere gratitude to all the referees for their insightful comments and suggestions, which led to a number of improvements to this article. Financially supported by the National Natural Science Foundation of China (Grant No. 11671164), and the Graduate Education Innovation Grant from Central China Normal University (Grant No. 2019CXPY001).

本校为第一且通讯机构

AbstractIt is well known to us that a graph of diameter has at least eigenvalues. A graph is said to be Laplacian (resp, normalized Laplacian) ‐extremal if it is of diameter having exactly distinct Laplacian (resp, normalized Laplacian) eigenvalues. A graph is split if its vertex set can be partitioned into a clique and a stable set. Each split graph is of diameter at most 3. In this paper, we completely classify the connected bidegreed Laplacian (resp, normalized Laplacian) 2‐extremal (resp, 3‐extremal) split graphs using the association of...