Nontrivial nuciferous graphs exist
Ebrahim Ghorbani

TL;DR
This paper disproves a conjecture that only the complete graph K_2 is nuciferous, showing that nontrivial nuciferous graphs do exist and proposing that infinitely many such Cayley graphs may exist.
Contribution
The authors disprove the existing conjecture about nuciferous graphs and introduce the possibility of infinitely many nuciferous Cayley graphs.
Findings
Nuciferous graphs other than K_2 exist.
The conjecture that only K_2 is nuciferous is false.
There may be infinitely many nuciferous Cayley graphs.
Abstract
A nuciferous graph is a simple graph with a non-singular - adjacency matrix such that all the diagonal entries of are zero and all the off-diagonal entries of are non-zero. Sciriha et al. conjectured that except , no nuciferous graph exists. We disprove this conjecture. Moreover, we conjecture that there infinitely many nuciferous Cayley graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Finite Group Theory Research · graph theory and CDMA systems
