Balanced 1-Factorisations of 3- and 4-Regular Circulant Graphs

2024/11/28 by Jeremy Mitchell, Mitchell, Jeremy
Engineering · Mathematics · Computer Science · #graph theory and CDMA systems #Finite Group Theory Research #Coding theory and cryptography

paper · pdf · doi:10.48550/arxiv.2411.19197

Abstract

We investigate 1-factorisations in which the 2-regular graphs that occur as the union of a pair of 1-factors appear an equal number of times across the unions of all pairs of 1-factors in the 1-factorisation. We call such 1-factorisations balanced 1-factorisations (B1Fs) and we present some results on B1Fs of 3- and 4-regular circulant graphs.

Related

• Factorisation of the complete graph into spanning regular factors
• On factorisations of complete graphs into circulant graphs and the Oberwolfach Problem
• On (1,C₄) one-factorization and two orthogonal (2,C₄) one-factorization of complete graphs
• Number of 1-factorizations of regular high-degree graphs
• An Infinite Family of Connected 1-Factorisations of Complete 3-Uniform Hypergraphs