×

On the nullity of bicyclic graphs. (English) Zbl 1144.05319

Summary: The nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. In this paper, we obtain the nullity set of bicyclic graphs of order \(n\), and determine the bicyclic graphs with maximum nullity.

MSC:

05C50 Graphs and linear algebra (matrices, eigenvalues, etc.)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Collatz, L.; Sinogowitz, U., Spektren endlicher Grafen, Abh. Math. Sem. Univ. Hamburg, 21, 63-77 (1957) · Zbl 0077.36704
[2] Longuet-Higgins, H. C., Resonance structures and MO in unsaturated hydrocarbons, J. Chem. Phys., 18, 265-274 (1950)
[3] Cvetkovic, D.; Doob, M.; Sachs, H., Spectra of Graphs (1980), Academic Press: Academic Press New York · Zbl 0458.05042
[4] Sciriha, I., On the construction of graphs of nullity one, Discrete Math., 181, 193-211 (1998) · Zbl 0901.05069
[5] I. Sciriha, On the rank of graphs, in: Y. Alavi, D.R. Lick, A. Schwenk (Eds.), Combinatorics, Graph Theory and Algorithms, vol. 2, Michigan, 1999, pp. 769-778.; I. Sciriha, On the rank of graphs, in: Y. Alavi, D.R. Lick, A. Schwenk (Eds.), Combinatorics, Graph Theory and Algorithms, vol. 2, Michigan, 1999, pp. 769-778.
[6] Sciriha, I., On singular line graphs of trees, Congressus Numeratium, 135, 73-91 (1998) · Zbl 0952.05047
[7] Sciriha, I.; Gutman, I., On the nullity of line graphs of trees, Discr. Math., 232, 35-45 (2001) · Zbl 0971.05070
[8] Fiorini, S.; Gutman, I.; Sciriha, I., Trees with maximum nullity, Linear Algebra Appl., 397, 245-251 (2005) · Zbl 1068.05015
[9] Tan, X. Z.; Liu, B. L., On the nullity of unicyclic graphs, Linear Algebra Appl., 408, 212-220 (2005) · Zbl 1073.05044
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.