TL;DR
This paper investigates Neumaier Cayley graphs, characterizing when they are strongly regular and classifying those with small valency up to 10, advancing understanding of their structure.
Contribution
It provides a necessary and sufficient condition for Neumaier Cayley graphs to be strongly regular and classifies those with valency at most 10.
Findings
Characterization of strongly regular Neumaier Cayley graphs
Classification of Neumaier Cayley graphs with valency ≤ 10
New structural insights into Neumaier Cayley graphs
Abstract
A Neumaier graph is a non-complete edge-regular graph with the property that it has a regular clique. In this paper, we study Neumaier Cayley graphs. We give a necessary and sufficient condition under which a Neumaier Cayley graph is a strongly regular Neumaier Cayley graph. We also characterize Neumaier Cayley graphs with small valency at most .
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
TopicsFinite Group Theory Research · graph theory and CDMA systems · Graph theory and applications