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

Abstract

XOR-magic graph labelings form a special subclass of group distance magic labelings. A simple connected graph of order 2n is called an open (respectively, closed) XOR-magic graph of power n if its vertices can be labeled bijectively with vectors from (Z2)n such that the sum (over (Z2)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>3, there exists an odd-regular open XOR-magic graph of power n and an even-regular closed XOR-magic graph of power n. We also show some applications of the spectra of graphs for an open XOR-magic labeling.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…