A nuciferous graph is a simple graph with a non-singular 0-1 adjacency matrix A such that all the diagonal entries of A − 1 are zero and all the off-diagonal entries of A − 1 are non-zero. Sciriha et al. conjectured that except K2, no nuciferous graph exists. We disprove this conjecture. Moreover, we conjecture that there are infinitely many nuciferous Cayley graphs.
@article{1025, title = {Nontrivial nuciferous graphs exist}, journal = {ARS MATHEMATICA CONTEMPORANEA}, volume = {12}, year = {2016}, doi = {10.26493/1855-3974.1025.466}, language = {EN}, url = {http://dml.mathdoc.fr/item/1025} }
Ghorbani, Ebrahim. Nontrivial nuciferous graphs exist. ARS MATHEMATICA CONTEMPORANEA, Tome 12 (2016) . doi : 10.26493/1855-3974.1025.466. http://gdmltest.u-ga.fr/item/1025/