Open AccessDominator Coloring of Hajós and Trampoline graph
Author(s) -
T. Manjula,
R. Rajeswari
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1770/1/012080
Subject(s) - combinatorics , graph coloring , graph , trampoline , mathematics , fractional coloring , discrete mathematics , computer science , graph power , line graph , operating system
A proper node coloring of a graph where every node of the graph dominates all nodes of some color class is called the dominator coloring of the graph. The least number of colors used in the dominator coloring of a graph is called the dominator coloring number denoted by χ d ( G ). The dominator coloring number and domination number of generalized Hajós graph, partial generalized Hajós graph and trampoline are derived and the relation between them are expressed in this paper.