English

Open XOR-magic odd graphs and closed XOR-magic even graphs

Combinatorics 2025-12-23 v1

Abstract

XOR-magic graph labelings form a special subclass of group distance magic labelings. A simple connected graph of order 2n2^n is called an open (respectively, closed) XOR-magic graph of power nn if its vertices can be labeled bijectively with vectors from (Z2)n(\mathbb{Z}_2)^n such that the sum (over (Z2)n(\mathbb{Z}_2)^n) of labels in each open (respectively, closed) neighborhood of every vertex is equal to the zero vector. In one paper, Batal asked whether there exists any odd-regular open XOR-magic graph or any even-regular closed XOR-magic graph. In this paper, with partial help of MILP solver, we answer this question in the affirmative. More precisely, we prove that for every integer n>3n>3, there exists an odd-regular open XOR-magic graph of power nn and an even-regular closed XOR-magic graph of power nn. We also show some applications of the spectra of graphs for an open XOR-magic labeling.

Keywords

Cite

@article{arxiv.2512.19278,
  title  = {Open XOR-magic odd graphs and closed XOR-magic even graphs},
  author = {Sylwia Cichacz and Hubert Grochowski and Rita Zuazua},
  journal= {arXiv preprint arXiv:2512.19278},
  year   = {2025}
}
R2 v1 2026-07-01T08:36:42.604Z