Open Access2-Distance Strong b-coloring of Perfect 𝜟-ary Tree
Author(s) -
M Poobalaranjani,
Sree Saraswathi
Publication year - 2021
Publication title -
ymer
Language(s) - English
Resource type - Journals
ISSN - 0044-0477
DOI - 10.37896/ymer20.10/23
Subject(s) - combinatorics , complete coloring , mathematics , fractional coloring , vertex (graph theory) , tree (set theory) , brooks' theorem , rainbow , edge coloring , discrete mathematics , graph , graph power , physics , chordal graph , 1 planar graph , quantum mechanics , line graph
A 2-distance -coloring is a 2-distance coloring in which every color class contains a vertex which has a neighbor in every other color class. A 2-distance strong -coloring (2- coloring) is a 2-distance coloring in which every color class contains a vertex such that there is a vertex in every other color class satisfying the condition that the distance between and is at most 2. The 2-distance -chromatic number 2() (2-number) is the largest integer such that admits a 2-distance -coloring with colors and the 2-distance strong bchromatic number 2() (2-number) is the maximum k such that admits a 2-coloring with colors. A tree with a special vertex called the root is called a rooted tree. A perfect - ary tree, is a rooted tree in which all internal vertices are of degree and all pendant vertices are at the same level. In this paper, the exact bound of the 2-number of perfect -ary tree are obtained.