Effects of Some Operations on Domination Chromatic Number in Graphs

09/12/2019
by   Yangyang Zhou, et al.
0

For a simple graph G, a domination coloring of G is a proper vertex coloring such that every vertex of G dominates at least one color class, and every color class is dominated by at least one vertex. The domination chromatic number, denoted by χ_dd(G), is minimum number of colors among all domination colorings of G. In this paper, we discuss the effects of some typical operations on χ_dd(G), such as vertex (edge) removal, vertex (edge) contraction, edge subdivision, and cycle extending.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/09/2019

On Domination Coloring in Graphs

A domination coloring of a graph G is a proper vertex coloring of G such...
research
08/02/2019

b-continuity and Partial Grundy Coloring of graphs with large girth

A b-coloring of a graph is a proper coloring such that each color class ...
research
08/27/2018

Explicit 3-colorings for exponential graphs

Let H=(V,E) denote a simple, undirected graph. The 3-coloring exponentia...
research
09/19/2022

Gradual Weisfeiler-Leman: Slow and Steady Wins the Race

The classical Weisfeiler-Leman algorithm aka color refinement is fundame...
research
08/20/2021

Wave Function Collapse Coloring: A New Heuristic for Fast Vertex Coloring

In this paper, we propose a high-speed greedy sequential algorithm for t...
research
02/04/2021

Extending Edge-colorings of Complete Hypergraphs into Regular Colorings

Let Xh be the collection of all h-subsets of an n-set X⊇ Y. Given a colo...
research
03/25/2020

On the Classification of Motions of Paradoxically Movable Graphs

Edge lengths of a graph are called flexible if there exist infinitely ma...

Please sign up or login with your details

Forgot password? Click here to reset