On constructing 1-factors of labelled complete graph
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Finite fields and commutative rings (number-theoretic aspects) (11T99)
This paper presents a clear and well-structured contribution to the study of 1-factors in labelled complete graphs, addressing a question posed by \textit{K. Ball} et al. [Mathematika 65, No. 3, 488--499 (2019; Zbl 1417.05021)] concerning 1-factor constructions linked to Hadamard-based factorizations. Using primitive roots of finite fields, the authors provide two constructive methods that yield 1-factors with distinct edge lengths and satisfying the quadratic-nonquadratic residue condition, and they successfully resolve the problem completely for the case \(p\equiv 5\pmod 8\). The arguments are rigorous, supported by concrete examples, and complemented by a discussion of special cases and open directions for further research. Overall, the paper makes a meaningful and technically solid contribution to combinatorial design theory and finite-field-based constructions.
- Four consecutive primitive elements in a finite field
- Graph theory with applications
- Hadamard matrices and 1-factorizations of complete graphs
- scientific article; zbMATH DE number 979131 (Why is no real title available?)
- On consecutive primitive elements in a finite field
- On the factorization of the complete graph
This page was built for publication: On constructing 1-factors of labelled complete graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6960217)
