Nontrivial nuciferous graphs exist
Abstract
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 infinitely many nuciferous Cayley graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.