an:05366446
Zbl 1168.05330
Sciriha, Irene
Coalesced and embedded nut graphs in singular graphs
EN
Ars Math. Contemp. 1, No. 1, 20-31 (2008).
00233537
2008
j
05C50 05B20 92E10
adjacency matrix; nut graph; kernel eigenvector; singular graphs; core; periphery; nut fullerenes; line graphs of trees
Summary: A nut graph has a non-invertible (singular) 0--1 adjacency matrix with non-zero entries in every kernel eigenvector. We investigate how the concept of nut graphs emerges as an underlying theme in the theory of singular graphs. It is known that minimal configurations (MCs) are necessarily found as subgraphs of singular graphs. We construct MCs having nut graphs as subgraphs. Nut graphs can be coalesced with singular graphs at particular vertices or grown into a family of core graphs of larger nullity by adding a vertex at a time. Moreover, we propose a construction of nut line graph of trees by coalescence and a local enlargement of nut fullerenes and tetravalent nut graphs.