Work

On constructing 1-factors of labelled complete graph

Year: 2025

Type: article

Abstract: Let p be a prime. Ball, Ortega-Moreno, and Prodromou asked about constructions of a 1-factor of a labelled $$K^{p+1}$$ K p + 1 graph that is connected to a Hadamard-based 1-factorization of complete graphs. In this paper, we give some constructions on this problem, based on the primitive roots of $$\mathbb {F}_p$$ F p . In particular, we completely answered the problem for the case $$p\equiv 5\pmod {8}$$ p ≡ 5 ( mod 8 ) .

Source: Boletín de la Sociedad Matemática Mexicana

DOI: 10.1007/s40590-025-00772-2

Authors: Muhammad Afifurrahman, Devi Imulia Dian Primaskun, Pritta Etriana Putri, Laurence P. Wijaya

Institutions: UNSW Sydney, The University of Melbourne, Bandung Institute of Technology, University of Kentucky

Language: English

Topic: Advanced Combinatorial Mathematics

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,290

Funders: University of New South Wales, Institut Teknologi Bandung