An \emph{ESD labeling} of an n-vertex graph G is an injective mapping of integers 1 to l to its vertices such that for every edge, the sum of the integers on its endpoints is unique.
Apr 15, 2018
Abstract. top We study edge-sum distinguishing labeling, a type of labeling recently introduced by Z. Tuza (2017) in context of labeling games.
Abstract. We study edge-sum distinguishing labeling, a type of labeling recently introduced by Z. Tuza (2017) in context of labeling games.
An \emph{ESD labeling} of an $n$-vertex graph $G$ is an injective mapping of integers $1$ to $l$ to its vertices such that for every edge, the sum of the ...
It is shown that ESD labeling is closely connected to the well-known notion of theidon sequence andharmonious labeling and to several classes of graphs if ...
We focus primarily on structural properties of this labeling and show for several classes of graphs if they have or do not have a canonical ESD labeling.
People also ask
What is an edge labeling in graph theory?
What is a sum labeling of a graph?
In 2017, Tuza [14] introduced the Edge-Sum Distinguishing labeling (ESD labeling), defined as follows: given a graph G and a set of consecutive integer labels ...
The Edge-Sum Distinguishing game (ESD game) is a graph labeling game proposed by Tuza in 2017. In such a game, the players, traditionally called Alice and ...
We focus primarily on structural properties of this labeling and show for several classes of graphs if they have or do not have a canonical ESD labeling. As an ...
An \emph{ESD labeling} of an $n$-vertex graph $G$ is an injective mapping of integers $1$ to $l$ to its vertices such that for every edge, the sum of the ...