On edge magic total labeling of \((7,3)\)-cycle books (Q1729016)

Graph labeling studies are kindled by one's interest to play with numbers or integers. In the process, a person's ability to exploit the hidden properties of numbers and ideas of number theory work wonders to obtain an appropriate labeling by fixing the right position for an integer $a$, a vertex or edge of a graph in a specific labeling task. Suppose that $G =(V, E)$ is a graph with $|V(G)|= p$ and $|E(G)|=q$. By an edge magic total labeling of $G$ we mean a bijective function $f:V(G)\cup E(G)\to\{1,2,\dots,p+q\}$ such that $f(w)+f(wz)+f(z) = k$ for any edge $wz\in E(G)$. We call $G$ an edge-magic total. In addition, if $f(V(G)) = \{1,2,\dots,p\}$, then we call $f$ a super edge-magic total labeling of $G$ and refer $G$ as a super edge-magic total. The authors of this paper succeed in generalizing the definition of cycle books and probed their edge-magic total labeling. We call a graph $G$ a $(a, b)$-cycle book graph $B[(C_a,m ), (C_b,n ),P t]$ if it consists of $m$ cycles $C_a$ and $n$ cycles $C_b$ with a common path $P_t$. The authors produce a labelling and establish that the $(7,3)$-cycle books $B[(C_7,1),(C_3,n ),P_2]$ admit an edge-magic total labeling. Also, they show that $(a, 3)$-cycle books $B[(C_a,1),(C_3,n ),P_2]$ admit super edge-magic total labeling for $a=7$ and extend the values of \(a\) to $4x-1$ for any positive integer $x$. Further, they say beyond doubt that the $(7,3)$-cycle books $B[(C_7,2),(C_3,n ),P_2]$ admit super edge-magic total labeling. The proof techniques are quite laudable and interesting.