Combinatorial configurations in the definition of antimagic labelings of graphs (Q2043998)

The edge labeling of the graph \(G =(V,E)\) is understood to be a bijective mapping \(\phi: E \rightarrow \{1,2,\dots, q\}\) that creates a weight function \(w_{phi}(u)=\sum_{v \in N(u)} \phi(u,v)\) over the set of vertices \(V\) for each of the vertices \(u \in V\). The weights of all the vertices \(G\) belong to the set that is designated as a weight set and denoted by \(W_{\phi}\). If the weights of all the vertices of \(G\) are different, then it is designated as an antimagic (or antimagic edge) labeling. \textit{S. Arumugam} and \textit{N. Kamatchi} [Australas. J. Comb. 54, 279--287 (2012; Zbl 1278.05205)] introduced the concept of \((a,d)\)-distance antimagic labeling. A graph \(G\) is said to be \((a,d)\)-distance antimagic if there exists a bijection \(f: V \rightarrow \{1,2, \dots, p\}\) such that the set of all vertex weights is \(\{a,a+d,a+2d,\dots, a+(p-1)d\}\) where \(a\) and \(d\) are fixed integers with \(d \geq 0\) and any graph which admits such a labeling is called an \((a,d)\)-distance antimagic graph. In this paper, the author formalizes the definition of \((a,d)\)-distance antimagic labeling in terms of combinatorial configurations.\\ A solution to the problem of construction of the indicated labelings for regular and biregular graphs using well-known combinatorial configuration classes, namely, separated systems and magic rectangle sets are obtained in this paper. The combinatorial configuration is determined by every assignment of numbers from a certain set to a graph element in accordance with the given rules. Assume that \(X=V=\{1,2,\dots, p\}\) and that \(Y\) is a permutation of numbers \(1,2,\dots, p\) which determines the \((a,d)\)-distance antimagic labeling. The properties of this labeling determines the restriction set \(\wedge\). Separating systems were proposed in [\textit{A. Rényi}, Acta Sci. Math. 22, 75--81 (1961; Zbl 0099.12204)] and magic rectangle sets were introduced by \textit{D. Froncek} [AKCE Int. J. Graphs Comb. 10, No. 2, 119--127 (2013; Zbl 1301.05289)]. Here, the defintions of separating systems \((SS)\), completely separating systems\((CSS)\), Roberts matrix \((C)\) and reverse Roberts matrix \(C^\ast\) are given. The author also mentions magic rectangles and the notations \(\rho\) and \(\sigma\). \[\rho = \sum_{j=1}^{n}a_{ij}=\frac{1}{2}n(kn+1) \ \text{for all} \ i\] \[\sigma = \sum_{j=1}^{k}a_{ij}=\frac{1}{2}k(kn+1) \ \text{for all} \ j.\] The author briefly explains the definition of configurations to describe completely separating systems and magic rectangle sets and also studies the interconnection between \(CSS\) and antimagic graph labeling. An example for finding an antimagic \(r-\)regular labeling of order \(p\) and \(q=\lfloor \frac{pr}{2}\rfloor\) is also discussed. Question: Is it possible to apply \(CSS\) to form new antimagic classes? The author answers this questions for a certain \(CSS\). The process of the construction of biregular graphs is illustrated in simple manner. The following theorem is proved: The graph \(t(K_{k}\times K_{n})\) is \((\frac{((k+n) (knt+1)-4nkt)}{2},2)-\)distance antimagic if \(k \equiv n \equiv 0\pmod 2\) and \(k \geq 2\), \(n \geq 4\). \par This paper is well written. The researcher will benefit a lot by reading this paper. The papers cited in the reference will be useful for researchers for carrying out further results on new graph classes with antimagic type labeling.