Related papers: On Magic Distinct Labellings of Simple Graphs

A {\it universal labeling} of a graph $G$ is a labeling of the edge set in $G$ such that in every orientation $\ell$ of $G$ for every two adjacent vertices $v$ and $u$, the sum of incoming edges of $v$ and $u$ in the oriented graph are…

An antimagic labeling of a directed graph $D$ with $n$ vertices and $m$ arcs is a bijection from the set of arcs of $D$ to the integers $\{1, \cdots, m\}$ such that all $n$ oriented vertex sums are pairwise distinct, where an oriented…

An edge labeling of a graph $G = (V, E)$ is said to be local antimagic if it is a bijection $f:E \to\{1,\ldots ,|E|\}$ such that for any pair of adjacent vertices $x$ and $y$, $f^+(x)\not= f^+(y)$, where the induced vertex label of $x$ is…

Let $G = (V,E)$ be a connected simple graph of order $p$ and size $q$. A graph $G$ is called local antimagic if $G$ admits a local antimagic labeling. A bijection $f : E \to \{1,2,\ldots,q\}$ is called a local antimagic labeling of $G$ if…

An antimagic labeling of a directed graph $D$ with $n$ vertices and $m$ arcs is a bijection from the set of arcs of $D$ to the integers $\{1, \cdots, m\}$ such that all $n$ oriented vertex sums are pairwise distinct, where an oriented…

A proper labeling of a graph is an assignment of integers to some elements of a graph, which may be the vertices, the edges, or both of them, such that we obtain a proper vertex coloring via the labeling subject to some conditions. The…

We investigate the \textit{group irregularity strength} ($s_g(G)$) of graphs, i.e. the smallest value of $s$ such that taking any Abelian group $\gr$ of order $s$, there exists a function $f:E(G)\rightarrow \gr$ such that the sums of edge…

For an arbitrary set of distances $D\subseteq \{0,1, \ldots, diam(G)\}$, a $D$-weight of a vertex $x$ in a graph $G$ under a vertex labeling $f:V\rightarrow \{1,2, \ldots , v\}$ is defined as $w_D(x)=\sum_{y\in N_D(x)} f(y)$, where $N_D(x)…

A total labeling of a graph $G = (V, E)$ is said to be local total antimagic if it is a bijection $f: V\cup E \to\{1,\ldots ,|V|+|E|\}$ such that adjacent vertices, adjacent edges, and incident vertex and edge have distinct induced weights…

In the literature, the notion of discrepancy is used in several contexts, even in the theory of graphs. Here, for a graph $G$, $\{-1, 1\}$ labels are assigned to the edges, and we consider a family $\mathcal{S}_G$ of (spanning) subgraphs of…

In graph theory, a graceful labeling of a graph with m edges is a labeling of its vertices with a subset of the integers ranging from 0 to m inclusive, such that no two vertices share a label, and each edge is uniquely identified by the…

Given a graph $G =(V,E)$, a bijection $f: E \rightarrow \{1, 2, \dots,|E|\}$ is called a local antimagic labeling of $G$ if the vertex weight $w(u) = \sum_{uv \in E} f(uv)$ is distinct for all adjacent vertices. The vertex weights under the…

Let $G = (V,E)$ be a finite simple undirected graph without isolated vertices. A bijective map $f: V \cup E \rightarrow \{1,2, \dots, |V|+ |E| \}$ is called total local antimagic labeling if for each edge $uv \in E, w(u) \ne w(v)$, where…

A $\Gamma$\emph{-distance magic labeling} of a graph $G = (V, E)$ with $|V| = n$ is a bijection $\ell$ from $V$ to an Abelian group $\Gamma$ of order $n$, for which there exists $\mu \in \Gamma$, such that the weight $w(x) =\sum_{y\in…

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

The automorphisms of a graph act naturally on its set of labeled imbeddings to produce its unlabeled imbeddings. The imbedding sum of a graph is a polynomial that contains useful information about a graph's labeled and unlabeled imbeddings.…

Given a digraph $D$ with $m $ arcs, a bijection $\tau: A(D)\rightarrow \{1, 2, \ldots, m\}$ is an antimagic labeling of $D$ if no two vertices in $D$ have the same vertex-sum, where the vertex-sum of a vertex $u $ in $D$ under $\tau$ is the…

The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing stability, of a graph $G$ is denoted by…

A $k$-antimagic labeling of a graph $G$ is an injection from $E(G)$ to $\{1,2,\dots,|E(G)|+k\}$ such that all vertex sums are pairwise distinct, where the vertex sum at vertex $u$ is the sum of the labels assigned to edges incident to $u$.…

Let G be a simple undirected graph and let A be an additive Abelian group with identity 0. In this paper, we introduce the concept of group magic spectrum of a graph G with respect to a given Abelian group A and is defined as spec(G, A):=…