Edge-sum distinguishing labeling

04/15/2018
by   Jan Bok, et al.
0

In this paper we study edge-sum distinguishing labeling, a type of labeling recently introduced by Tuza tuza2017graph in context of labeling games. An 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. If l equals to n, we speak about a canonical ESD labeling. 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 application we show some implications of these results for games based on ESD labeling. Also, we show that ESD labeling is closely connected to the well-known notion of the Sidon sequence and harmonious labeling.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/07/2023

Tyshkevich's Graph Decomposition and the Distinguishing Numbers of Unigraphs

A c-labeling ϕ: V(G) →{1, 2, , c } of graph G is distinguishing if, for ...
research
11/29/2022

Local canonical labeling of Erdős–Rényi random graphs

We study local canonical labeling algorithms on an Erdős–Rényi random gr...
research
11/15/2019

Graph Iso/Auto-morphism: A Divide- -Conquer Approach

The graph isomorphism is to determine whether two graphs are isomorphic....
research
03/22/2022

The neighbour sum distinguishing edge-weighting with local constraints

A k-edge-weighting of G is a mapping ω:E(G)⟶{1,…,k}. The edge-weighting ...
research
05/26/2021

Total, Equitable Total and Neighborhood sum distinguishing Total Colorings of Some Classes of Circulant Graphs

In this paper, we have obtained the total chromatic as well as equitable...
research
03/06/2023

On computing sets of integers with maximum number of pairs summing to powers of 2

We address the problem of finding sets of integers of a given size with ...
research
01/18/2022

Improved Bounds on the Span of L(1,2)-edge Labeling of Some Infinite Regular Grids

For two given nonnegative integers h and k, an L(h,k)-edge labeling of a...

Please sign up or login with your details

Forgot password? Click here to reset