Name
Abstract | ||
|---|---|---|
Let G be a mixed graph and let L(G) be the Laplacian matrix of the graph G. The first eigenvalue and the first eigenvectors of G are respectively referred to the least nonzero eigenvalue and the corresponding eigenvectors of L(G). In this paper we focus on the properties of the first eigenvalue and the first eigenvectors of a nonsingular unicyclic mixed graph (abbreviated to a NUM graph). We introduce the notion of characteristic set associated with the first eigenvectors, and then obtain some results on the sign structure of the first eigenvectors. By these results we determine the unique graph which minimizes the first eigenvalue over all NUM graphs of fixed order and fixed girth, and the unique graph which minimizes the first eigenvalue over all NUM graphs of fixed order. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.disc.2008.05.034 | Discrete Mathematics |
Keywords | Field | DocType |
eigenvalue,mixed graph,characteristic set,unicyclic graph,eigenvector,girth,eigenvalues,laplacian matrix,eigenvectors | Discrete mathematics,Combinatorics,Line graph,Spectral graph theory,Eigenvalue perturbation,Graph power,Algebraic connectivity,Symmetric graph,Voltage graph,Mathematics,Complement graph | Journal |
Volume | Issue | ISSN |
309 | 8 | Discrete Mathematics |
Citations | PageRank | References |
4 | 0.80 | 1 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yi-Zheng Fan | 1 | 28 | 11.02 |
| Shi-Cai Gong | 2 | 9 | 3.38 |
| Yi Wang | 3 | 9 | 3.35 |
| Yu-Bin Gao | 4 | 6 | 7.70 |