Name
Abstract | ||
|---|---|---|
Controllable graphs are connected graphs in which all eigenvalues are mutually distinct and main. In this work, a new method of characterizing the controllability of graphs with diameter n & minus; 2 is presented. A necessary and sufficient condition determining non-main eigenvalue of graphs with diameter n & minus; 2 is obtained, and the controllability of two kinds of graphs with diameter n & minus; 2 is characterized. Besides, the visualization representation of statistical results of controllable graphs is presented, and they show that the proportion of controllable graphs among the graphs with diameter n & minus; 2 is stablely at 15% , which partly verifies a conjecture proposed by Stani c & acute;.(c) 2021 Elsevier Inc. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.amc.2021.126327 | APPLIED MATHEMATICS AND COMPUTATION |
Keywords | DocType | Volume |
Controllable graph, Adjacency spectrum, Main eigenvalue, Diameter | Journal | 407 |
ISSN | Citations | PageRank |
0096-3003 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liang Wei | 1 | 0 | 0.34 |
| Faxu Li | 2 | 0 | 0.34 |
| Haixing Zhao | 3 | 18 | 13.27 |
| Bo Deng | 4 | 0 | 0.34 |