Abstract | ||
---|---|---|
We characterize the extremal digraphs which attain the maximum Perron root of digraphs with given arc connectivity and number of vertices. We also characterize the extremal digraphs which attain the maximum Perron root of digraphs given diameter and number of vertices. |
Year | DOI | Venue |
---|---|---|
2013 | 10.1016/j.disc.2013.07.016 | Discrete Mathematics |
Keywords | Field | DocType |
Digraph,Arc connectivity,Diameter,Characteristic polynomial,Perron root | Characteristic polynomial,Discrete mathematics,Combinatorics,Vertex (geometry),Mathematics,Digraph | Journal |
Volume | Issue | ISSN |
313 | 22 | 0012-365X |
Citations | PageRank | References |
2 | 0.53 | 2 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Huiqiu Lin | 1 | 34 | 11.56 |
S. W. Drury | 2 | 3 | 1.15 |