zbMATH — the first resource for mathematics

On the construction of graphs of nullity one. (English) Zbl 0901.05069
The author classifies the sets of \(k\) \((2\leq k\leq 5)\) linearly dependent rows of the adjacency matrix of a graph. Induced subgraphs related to these sets can be of some help in determining the multiplicity of the eigenvalue \(0\). Some constructions of graphs having eigenvalue \(0\) in the spectrum are given as well.

05C50 Graphs and linear algebra (matrices, eigenvalues, etc.)
Full Text: DOI
[1] Collatz, L.; Sinogowitz, U., Spektren endlicher grafen, Abh. math. sem. univ. Hamburg, 70-75, (1957) · Zbl 0077.36704
[2] Cotton, F.A., Chemical applications of group theory, (), 117-182
[3] Cvetković, D.; Gutman, I.M., The algebraic multiplicity of the number zero in the spectrum of a bipartite graph, Mat. vesnik, 9, 24, 141-150, (1972) · Zbl 0263.05125
[4] Cvetković, D.; Gutman, I.M.; Trinajstić, N., Graph theory and molecular orbitals, Croatica chem. acta, 44, 365-374, (1972)
[5] I.M. Gutman, (1995) personal communication.
[6] Gutman, I.; Sciriha, I., Graphs with maximum singularity, Graph theory notes, New York, XXX, 17-20, (1996)
[7] Schwenk, A., Computing the characteristic polynomial of a graph, (), 45-51
[8] Sciriha, I., On the rank of graphs, () · Zbl 0894.05042
[9] Sciriha, I., On the coefficient of λ in the characteristic polynomial of singular graphs, Utilitas Mathematica, (1997) · Zbl 0893.05010
[10] Sciriha, I.; Fiorini, S., On the characteristic polynomial of homeomorphic images of a graph, Discrete math., 174, 293-308, (1997) · Zbl 0894.05042
[11] I. Sciriha, I. Gutman, Nut graphs—properties and construction, forthcoming. · Zbl 0919.05043
[12] Spialter, L., The atom connectivity matrix and its characteristic polynomial, J. chem.doc., 4, 261-274, (1964)
[13] Wilson, R., Singular graphs, (), 228-236, 0507
[14] Zivković, T., Calculations of the non-bonding molecular orbitals in the Hückel theory, Croatica chem. acta, 44, 351-364, (1972)
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.