DeepAI
Log In Sign Up

Graphs without gap-vertex-labellings: families and bounds

07/02/2020
by   C. A. Weffort-Santos, et al.
0

A proper labelling of a graph G is a pair (π,c_π) in which π is an assignment of numeric labels to some elements of G, and c_π is a colouring induced by π through some mathematical function over the set of labelled elements. In this work, we consider gap-vertex-labellings, in which the colour of a vertex is determined by a function considering the largest difference between the labels assigned to its neighbours. We present the first upper-bound for the vertex-gap number of arbitrary graphs, which is the least number of labels required to properly label a graph. We investigate families of graphs which do not admit any gap-vertex-labelling, regardless of the number of labels. Furthermore, we introduce a novel parameter associated with this labelling and provide bounds for it for complete graphs K_n.

READ FULL TEXT

page 1

page 2

page 3

page 4

07/27/2021

The Space Complexity of Sum Labelling

A graph is called a sum graph if its vertices can be labelled by distinc...
10/28/2019

Distinguishing numbers and distinguishing indices of oriented graphs

A distinguishing r-vertex-labelling (resp. r-edge-labelling) of an undir...
12/03/2020

Optimal labelling schemes for adjacency, comparability and reachability

We construct asymptotically optimal adjacency labelling schemes for ever...
01/05/2023

Sum Labelling Graphs of Maximum Degree Two

The concept of sum labelling was introduced in 1990 by Harary. A graph i...
07/02/2018

Minimum Labelling bi-Connectivity

A labelled, undirected graph is a graph whose edges have assigned labels...
02/08/2021

Local certification of graphs on surfaces

A proof labelling scheme for a graph class 𝒞 is an assignment of certifi...
02/14/2011

Rule-based transformations for geometric modelling

The context of this paper is the use of formal methods for topology-base...