Induced magic labeling of some graphs

Let G be a simple graph, let f : V(G)&#8594{1,2,...,|V(G)|} be a bijective mapping. The weight of v &#8712 V(G) is the sum of labels of all vertices adjacent to v . We say that f is a distance magic labeling of G if the weight of every vertex is the same constant k and we say that f is a handicap magic labeling of G if the weight of every vertex v is l + f(v) for some constant l. Graphs that allow such labelings are called distance magic or handicap, respectively. Distance magic and handicap labelings of regular graphs are used for scheduling incomplete tournaments. While distance magic labelings correspond to so called equalized tournaments, handicap labelings can be used to schedule incomplete tournaments that are more challenging to stronger teams or players, hence they increase competition and yield attractive schemes in which every games counts. We summarize known results on distance magic and handicap labelings and construct a new infinite class of 4-regular handicap graphs.

For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic} if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$ defined as $f^+(v) = sum f(uv)$ taken over all edges $uv$ incident at $v$ is a constant. An $A$-textit{magic} graph $G$ is said to be $Z_k$-magic graph if the group $A$ is $Z_k$ the group of integers modulo $k$. These $Z_k$-magic graphs are referred to as $k$-textit{magic} graphs. In this paper we prove that the total graph, flower graph, generalized prism graph, closed helm graph, lotus inside a circle graph, $Godotoverline{K_m}$, $m$-splitting graph of a path and $m$-shadow graph of a path are $Z_k$-magic graphs.

Let $V_4=\{0, a, b, c\}$ be the Klein-4-group with identity element 0 .A graph $G(V(G), E(G))$ is said to be neighbourhood $V_4$-magic if there exists a labeling $f: V(G) \rightarrow V_4 \backslash\{0\}$ such that the induced mapping $N_f^{+}: V(G) \rightarrow V_4$ defined by $N_f^{+}(v)=\sum_{u \in N(v)} f(u)$ is a constant map. If this constant is $p(p \neq 0)$, we say that $f$ is a $p$-neighbourhood $V_4$-magic labeling of $G$ and $G$ a $p$-neighbourhood $V_4$-magic graph. If this constant is zero, we say that $f$ is a 0 -neighghbourhood $V_4$-magic labeling of $G$ and $G$ a 0 -neighbourhood $V_4$-magic graph. In this paper we investigate middle graph of some special graphs that are $a$-neighbourhood $V_4$-magic, 0 -neighbourhood $V_4$-magic and both $a$-neighbourhood and 0 -neighbourhood $V_4$-magic.

Klein cordial trees and odd cyclic cordial friendship graphs

This paper deals with the labeling of vertices and edges of a graph. Let G be a graph with vertex set V and edge set E, where |V| be the number of vertices and |E| edges of G. The two bijection methods for which we have designed algorithms are as follows. Initially A bijection λ 1:V∪E → {1, 2…|V| + |E|} is called a Vertex-Magic Total Labeling (VMTL) if there is a vertex magic constant vk such that the weight of vertex m is, λ 1(m) + Σ n εA (m) λ 1(mn) = vk, ∀ m εv Where A(m) is the set of vertices adjacent to x. In the similar fashion the bijection λ 2:V∪E → {1, 2…|V| + |E|} is called Edge-Magic Total Labeling (EMTL) if there is a edge magic constant ek such that the weight of an edge es(mn), λ 2(m) + λ 2(n) + λ 2 e(mn) = ek, ∀ e εE. A resultant Graph which consists of both VMTL and EMTL are said to be Total Magic Labeling (TML) for different vertex magic constant and edge magic constant values. Baker and Sawada proposed algorithms to find VMTLs on cycles and wheels. In this paper we enhanced these algorithms and also we proposed new algorithms to generate EMTLs and TMLs of cycles and wheels. We used the concept variations and sum set sequences to produce VMTLs and EMTLs on cycles and wheels. Also we designed modules to identify TML’s.KeywordsMagic labelingMagic labeling algorithmsMagic constantCyclesWheelsVertex Magic Total LabelingEdge Magic Total LabelingTotal Magic Labeling etc

Given a graph G with n vertices and m edges and an abelian group A of order equal to max(n,m). By labeling of A∗-vertex magic labeling and A∗-edge magic labeling we mean a pair one-to-one maps, one from V(G) to A, and another one from E(G) to A, rather than the bijection maps considered in the literature from V(G)∪E(G) to A, and new results were obtained.

This paper discusses fuzzy labeling graph and its properties. The properties discussed are fuzzy labeling subgraph, union graph, and fuzzy magic graph. The results showed that the strength of connectedness for pair of vertices in a graph with fuzzy labeling is always greater than or equal to the strength of connectedness for pair of vertices in its subgraph. In addition, union of two graph with fuzzy labeling will form a graph with fuzzy labeling. Meanwhile, on magic labeling there is always a fuzzy bridge on fuzzy magic graph.

For any additive abelian group $A$. Let $\mu$ be an element of $A$, a graph $G=(V,E)$ is said to be $A$-vertex magic graph if there exist a labeling function $f:V(G)\rightarrow A\setminus\{0\}$ such that $\omega(v)=\sum_{u\in N(v)} f(u)=\mu$ for any vertex $v$ of $G$, where $N(v)$ is the set of the open neighborhood of $v$. In this paper, we prove that the graphs such as wheel, Corona $C_{n}\odot mk$, subdivision of ladder and $t$-fold wheel for $t\neq n$ nor $n-2$ are $A$-vertex magic graphs. Also we prove that the subdivide wheel, helm and closed helm are $Z_{k}$-vertex magic graphs. However we prove that the triangular book and $t$-fold wheel for $t=n,n-2$ are group vertex magic graphs.

Research in graph theory has lead to one of the important area called labeling of graphs. There are different types of labeling such as graceful labeling, magic labeling, edge-graceful labeling, prime labeling, radio labeling, harmonious labeling etc., In this paper, we investigate the existence of edge graceful labeling for the Corona graph Cn⊙K2¯ (n is odd n ≥ 3). Also we have defined a flower graph which does not admit an edge-graceful labeling.

Let G = (V, E) be a simple graph with n vertices, and let A be an abelian group of order n. Let f: V(G) → A be a bijection, and define the weight of a vertex x by w(x) = Σy ∈ N(x) f(y), where N(x) denotes the open neighborhood of x. We call f an A-distance magic labeling if all vertex weights are equal, and an A-distance antimagic labeling if the weights of distinct vertices are pairwise different. The prime graph of a commutative ring R is the simple graph with vertex set R in which two vertices x and y are adjacent if and only if xRy = {0}. In this paper, we investigate the existence of A-distance magic and A-distance antimagic labelings of the prime graph over the ring Zn for several values of n.

A $Γ$\emph{-distance magic labeling} of a graph $G = (V, E)$ with $|V| = n$ is a bijection $\ell$ from $V$ to an Abelian group $Γ$ of order $n$, for which there exists $μ\in Γ$, such that the weight $w(x) =\sum_{y\in N(x)}\ell(y)$ of every vertex $x \in V$ is equal to $μ$. In this case, the element $μ$ is called the \emph{magic constant of} $G$. A graph $G$ is called a \emph{group distance magic} if there exists a $Γ$-distance magic labeling of $G$ for every Abelian group $Γ$ of order $n$. In this paper, we focused on cubic $Γ$-distance magic graphs as well as some properties of such graphs.

Gaussian anti magic labeling in some special graphs

A graph G is an ordered pair of sets G(V, E), where V is a set of vertices and the elements of set E are usually called edges. The concept of graph labeling has recently gained a lot of popularity in the area of graph theory. his popularity is due not only to the mathematical challenges of graph labelings but also to the wide range of applications that graph labeling offer to other brances of science, for instance, x-ray, cryptography, coding theory, circuit design and communication network design. A graph labeling we mean an assignment of integers to elements of a graph such as vertex, edge, and both. Local antimagic of a graph was motivated by Arumugam et al.. Thus, we initiate to developed the concept of local antimagic vertex coloring for subdevided graphs. A graph G called sub-devided if the graph G be the graph obtained by inserting a vertex to each edge of the graph G. Definition the concept local antimagic vertex coloring is f : E(G) → {1, 2, 3…, |E(G)|} if for any two adjacent vertices a 1 and a 2, w(a 1) = w(a 2), where for v ∈ G, , where E(a) and V(a) are respectively the set of edges incident to a. The local antimagic vertex labeling induces a proper vertex coloring of graph G if each vertex a is assigned the color w(a). The minimum colors needed to coloring the vertices in graph G called local antimagic vertex chromatic number, denoted by χla (G). In this paper we study the local antimagic vertex coloring of sub-devided some special graph as follows SFn,m , SSn,m , SWn,m and SFn,m .

Consecutive magic graphs

Distance magic graphs [formula omitted