Sum Labelling Graphs of Maximum Degree Two

01/05/2023
by   Henning Fernau, et al.
0

The concept of sum labelling was introduced in 1990 by Harary. A graph is a sum graph if its vertices can be labelled by distinct positive integers in such a way that two vertices are connected by an edge if and only if the sum of their labels is the label of another vertex in the graph. It is easy to see that every sum graph has at least one isolated vertex, and every graph can be made a sum graph by adding at most n^2 isolated vertices to it. The minimum number of isolated vertices that need to be added to a graph to make it a sum graph is called the sum number of the graph. The sum number of several prominent graph classes (e.g., cycles, trees, complete graphs) is already well known. We examine the effect of taking the disjoint union of graphs on the sum number. In particular, we provide a complete characterization of the sum number of graphs of maximum degree two, since every such graph is the disjoint union of paths and cycles.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/27/2021

The Space Complexity of Sum Labelling

A graph is called a sum graph if its vertices can be labelled by distinc...
research
05/17/2023

Optimal Seat Arrangement: What Are the Hard and Easy Cases?

We study four NP-hard optimal seat arrangement problems [Bodlaender et a...
research
06/20/2019

Extra-factorial sum: a graph-theoretic parameter in Hamiltonian cycles of complete weighted graphs

A graph-theoretic parameter, in a form of a function, called the extra-f...
research
12/19/2017

The cavity approach for Steiner trees Packing problems

The Belief Propagation approximation, or cavity method, has been recentl...
research
05/05/2023

Sum-of-Local-Effects Data Structures for Separable Graphs

It is not difficult to think of applications that can be modelled as gra...
research
02/25/2023

Construction numbers: How to build a graph?

We count the number of ways to build paths, stars, cycles, and complete ...
research
07/02/2018

Minimum Labelling bi-Connectivity

A labelled, undirected graph is a graph whose edges have assigned labels...

Please sign up or login with your details

Forgot password? Click here to reset