arXiv Analytics

Sign in

arXiv:2411.19197 [math.CO]AbstractReferencesReviewsResources

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

Jeremy Mitchell

Published 2024-11-28Version 1

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.

Comments: 27 pages, 11 figures
Categories: math.CO
Subjects: 05C70
Related articles: Most relevant | Search more
arXiv:1811.03803 [math.CO] (Published 2018-11-09)
On rationality of generating function for the number of spanning trees in circulant graphs
arXiv:1111.0316 [math.CO] (Published 2011-11-01)
Irregular Labellings of Circulant Graphs
arXiv:2401.01691 [math.CO] (Published 2024-01-03)
2-Rainbow domination number of circulant graphs C(n; {1,4})

Links

Toolbox