Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
