The nullity of a graph G, denoted by ฮท(G), is the multiplicity of the eigenvalue zero in its spectrum. The extremal graphs attaining the upper bound n-2 and the second upper bound n-3 have been obtained. In this paper, the graphs with nullity n-4 are characterized. Furthermore the tricyclic graphs
On the nullity of bicyclic graphs
โ Scribed by Shengbiao Hu; Tan Xuezhong; Bolian Liu
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 139 KB
- Volume
- 429
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This paper studies singular graphs by considering minimal singular induced subgraphs of small order. These correspond to a number k of linearly dependent rows of the adjacency matrix determining what is termed as a core of the singular graph. For k at most 5, the distinct cores and corresponding min
The nullity of a graph G, denoted by ฮท(G), is the multiplicity of the eigenvalue zero in its spectrum. Cheng and Liu [B. Cheng, B. Liu, On the nullity of graphs, Electron. J. Linear Algebra 16 (2007) 60-67] characterized the extremal graphs attaining the upper bound n -2 and the second upper bound n