On 12-regular nut graphs

From MaRDI portal
Publication:5045255




Abstract: A nut graph is a simple graph whose adjacency matrix is singular with 1-dimensional kernel such that the corresponding eigenvector has no zero entries. In 2020, Fowler et al. characterised for each din3,4,ldots,11 all values n such that there exists a d-regular nut graph of order n. In the present paper, we determine all values n for which a 12-regular nut graph of order n exists. We also present a result by which there are infinitely many circulant nut graphs of degree dequiv0pmod4 and no circulant nut graph of degree dequiv2pmod4.





Describes a project that uses

Uses Software





This page was built for publication: On 12-regular nut graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045255)