Related papers: Non-magic Hypergraphs

Hefetz, M\"{u}tze, and Schwartz conjectured that every connected undirected graph admits an antimagic orientation. In this paper we support the analogous question for distance magic labeling. Let $\Gamma$ be an Abelian group of order $n$. A…

Let a_1,...,a_k satisfy a_1+...+a_k=1 and suppose a k-uniform hypergraph on n vertices satisfies the following property; in any partition of its vertices into k sets A_1,...,A_k of sizes a_1*n,...,a_k*n, the number of edges intersecting…

A graph $G = (V, E)$ is called antimagic if there exists a bijective labelling $f : E \rightarrow \{1, 2, \ldots, |E|\}$ such that the vertex-sums of labels over edges incident to a given vertex are all distinct. In this paper, we extend…

An {\em antimagic labeling} of a graph with $m$ edges and $n$ vertices is a bijection from the set of edges to the integers $1,...,m$ such that all $n$ vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges…

Since the beginning of the quest of hypercomplex numbers in the late eighteenth century, many hypercomplex number systems have been proposed but none of them succeeded in extending the concept of complex numbers to higher dimensions. This…

We give a variety of magic hexagons of Orders from 3 to 7, many of which are extensions of known results. We also give a theorem that their are an infinite number of magic hexagons of Order $n$ for any fixed positive integer $n$ for any…

Let k be a natural number. We introduce k-threshold graphs. We show that there exists an O(n^3) algorithm for the recognition of k-threshold graphs for each natural number k. k-Threshold graphs are characterized by a finite collection of…

Magic squares are arrangements of natural numbers into square arrays, where the sum of each row, each column, and both diagonals is the same. In this paper, the concept of a magic square with 3 rows and 3 columns is generalized to define…

Regular hypermaps with underlying simple hypergraphs are analysed. We obtain an algorithm to classify the regular embeddings of simple hypergraphs with given order, and determine the automorphism groups of regular embedding of simple…

Let $G=(V,E)$ be a graph of order $n$. A distance magic labeling of $G$ is a bijection $\ell \colon V\rightarrow {1,...,n}$ for which there exists a positive integer $k$ such that $\sum_{x\in N(v)}\ell (x)=k$ for all $v\in V $, where $N(v)$…

An antimagic {labeling} of a graph $G=(V,E)$ is a one-to-one mapping $f: E\rightarrow\{1,2,\ldots,|E|\}$, ensuring that the vertex sums in $V$ are pairwise distinct, where a vertex sum of a vertex $v$ is defined as the sum of the labels of…

The $k$-coprime graph of order $n$ is the graph with vertex set $\{k, k+1, \ldots, k+n-1\}$ in which two vertices are adjacent if and only if they are coprime. We characterize Hamiltonian $k$-coprime graphs. As a particular case, two…

Unigraphs are graphs uniquely determined by their own degree sequence up to isomorphism. There are many subclasses of unigraphs such as threshold graphs, split matrogenic graphs, matroidal graphs, and matrogenic graphs. Unigraphs and these…

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

A graph $G=(V,E)$ is antimagic if there is a one-to-one correspondence $f: E \to \{1,2,\ldots, |E|\}$ such that for any two vertices $u,v$, $\sum_{e \in E(u)}f(e) \ne \sum_{e\in E(v)}f(e)$. It is known that bipartite regular graphs are…

We introduce jacobian graphs, which are explicit families of regular graphs that are spectrally indistinguishable from random graphs, but whose local structure is very different from that of random graphs. The construction relies on the…

The vertices of a $k$-token graph of a graph $G$ correspond to $k$ indistinguishable tokens placed on $k$ different vertices of $G$. Changing some conditions on both the nature of the tokens and the number of tokens allowed in each vertex…

We describe how to construct and enumerate Magic squares, Franklin squares, Magic cubes, and Magic graphs as lattice points inside polyhedral cones using techniques from Algebraic Combinatorics. The main tools of our methods are the Hilbert…

A \emph{group distance magic labeling} or a $\gr$-distance magic labeling of a graph $G(V,E)$ with $|V | = n$ is an injection $f$ from $V$ to an Abelian group $\gr$ of order $n$ such that the weight $w(x)=\sum_{y\in N_G(x)}f(y)$ of every…

Global control offers a promising route to scalable quantum computing. A recent conjecture by Hu et al. (arXiv:2508.19075) proposes that any connected qubit graph equipped with global Ising-type interactions and tunable global transverse…