Abstract
Let \( G \) be a simple undirected graph on n vertices, \( A(G) \) be its adjacency matrix. The nullity \( \eta (G) \) of the graph \( G \) is the multiplicity of the eigenvalue zero in its spectrum. In this paper, we characterize the bicyclic graphs with nullity \( n - 5 \).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Collatz L, Sinogowitz U (1957) Spektren endlicher Grafen. Abh. Math Univ Hamburg, 2163–2167
Hu S, Xuezhong T, Liu B (2008) On the nullity of bicyclic graphs. Linear Algebra Appl, 4291387–4291391
Sciriha I (1999) On the rank of graphs. In: Alavi Y, Lick DR, Schwenk A (eds) Combinatorics, graph theory and algorithms, vol 2. Michigan, pp 769–778
Sciriha I (1998) On the construction of nullity one. Discrete Math 181193–181211
Sciriha I (1998) On singular line graphs of trees. Congressus Numeratium, 13573–13591
Tan XZ, Liu BL (2005) On the nullity of unicyclic graphs. Linear Algebra Appl 408:212–222
Cvetkovic D, Doob M, Sachs H (1980) Spectra of graphs. Academic Press, New York
Gong S-C, Fan Y-Z, Yin Z-X (2009) The tree with second largest Laplacian spread. Academic Press, Hangzhou
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zheng, Tt. (2013). Bicyclic Graphs with Nullity n−5. In: Yin, Z., Pan, L., Fang, X. (eds) Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013. Advances in Intelligent Systems and Computing, vol 212. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37502-6_69
Download citation
DOI: https://doi.org/10.1007/978-3-642-37502-6_69
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37501-9
Online ISBN: 978-3-642-37502-6
eBook Packages: EngineeringEngineering (R0)