Tyshkevich's Graph Decomposition and the Distinguishing Numbers of Unigraphs

08/07/2023
by   Christine T. Cheng, et al.
0

A c-labeling ϕ: V(G) →{1, 2, , c } of graph G is distinguishing if, for every non-trivial automorphism π of G, there is some vertex v so that ϕ(v) ≠ϕ(π(v)). The distinguishing number of G, D(G), is the smallest c such that G has a distinguishing c-labeling. We consider a compact version of Tyshkevich's graph decomposition theorem where trivial components are maximally combined to form a complete graph or a graph of isolated vertices. Suppose the compact canonical decomposition of G is G_k∘ G_k-1∘⋯∘ G_1 ∘ G_0. We prove that ϕ is a distinguishing labeling of G if and only if ϕ is a distinguishing labeling of G_i when restricted to V(G_i) for i = 0, , k. Thus, D(G) = max{D(G_i), i = 0, , k }. We then present an algorithm that computes the distinguishing number of a unigraph in linear time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/15/2018

Edge-sum distinguishing labeling

In this paper we study edge-sum distinguishing labeling, a type of label...
research
10/28/2019

Distinguishing numbers and distinguishing indices of oriented graphs

A distinguishing r-vertex-labelling (resp. r-edge-labelling) of an undir...
research
09/23/2019

A note on the neighbour-distinguishing index of digraphs

In this note, we introduce and study a new version of neighbour-distingu...
research
04/17/2018

Progress on the adjacent vertex distinguishing edge colouring conjecture

A proper edge colouring of a graph is adjacent vertex distinguishing if ...
research
03/05/2023

Union vertex-distinguishing edge colorings

The union vertex-distinguishing chromatic index χ'_∪(G) of a graph G is ...
research
10/09/2018

Contraction-Based Sparsification in Near-Linear Time

Recently, Kawarabayashi and Thorup presented the first deterministic edg...
research
07/12/2023

Connectivity Labeling for Multiple Vertex Failures

We present an efficient labeling scheme for answering connectivity queri...

Please sign up or login with your details

Forgot password? Click here to reset