On the Ubiquity and Utility of Cyclic Schemes
M. Abreu, M. J. Funk, D. Labbate, V. Napolitano

TL;DR
This paper explores cyclic schemes in algebraic graph theory, demonstrating their utility in constructing regular graphs, bipartite graphs, and configurations, and introduces new methods and proofs for these structures.
Contribution
It introduces a unified framework of cyclic schemes for constructing graphs and configurations, providing new constructions and proofs for known combinatorial structures.
Findings
Constructed new bipartite graphs of girth 6 with minimal vertices.
Provided new proofs for existing combinatorial configurations.
Developed a framework linking cyclic schemes to various graph and configuration constructions.
Abstract
Let , and be positive integers. A --{\it scheme of valency} and {\it order} is a array of subsets such that for each row and column one has and , respectively. Any such scheme is an algebraic equivalent of a -semi-regular bipartite voltage graph with and vertices in the bipartition sets and voltages coming from the cyclic group . We are interested in the subclass of --schemes that are characterized by the property (mod ) for all , , , and where and need not be distinct. These --schemes can be used to represent adjacency matrices of…
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 · Interconnection Networks and Systems
