scholarly journals On locating chromatic number of Möbius ladder graphs

2021 ◽  
Vol 40 (3) ◽  
pp. 659-669
Author(s):  
Redha Sakri ◽  
Moncef Abbas
Keyword(s):  
Chromatic Number ◽  
Ladder Graphs

In this paper, we are dealing with the study of locating chromatic number of Möbius-ladders. We prove that Möbius-ladders Mn with n even has locating chromatic number 4 if n≠6 and 6 if n=6.

scholarly journals C++ Programme for total dominator chromatic number of ladder graphs through simple transformations

2020 ◽  
Vol 8 (4) ◽  
pp. 1480-1487
Author(s):  
J. Virgin Alangara Sheeba ◽  
Vijayalekshmi A.
Keyword(s):  
Chromatic Number ◽  
Ladder Graphs

Total dominator chromatic number of paths, cycles and ladder graphs

2018 ◽  
Vol 13 (5) ◽  
pp. 199-204
Author(s):  
A. Vijayalekshmi ◽  
J. Virgin Alangara Sheeba
Keyword(s):  
Chromatic Number ◽  
Ladder Graphs

scholarly journals An alternate C++ programme for the total dominator chromatic number of ladder graphs

2020 ◽  
Vol 8 (2) ◽  
pp. 602-607
Author(s):  
A. Vijayalekshmi ◽  
J.Virgin Alangara Sheeba
Keyword(s):  
Chromatic Number ◽  
Ladder Graphs

Vertex-Distinguishing Total Coloring of Ladder Graphs (N=0(mod 8) )

2011 ◽  
Vol 225-226 ◽  
pp. 243-246
Author(s):  
Zhi Wen Wang
Keyword(s):  
Chromatic Number ◽  
Simple Graph ◽  
Total Coloring ◽  
Total Chromatic Number ◽  
Proper Total Coloring ◽  
Ladder Graphs

A proper total coloring of a simple graph G is called vertex distinguishing if for any two distinct vertices u and v in G, the set of colors assigned to the elements incident to u differs from the set of colors incident to v. The minimal number of colors required for a vertex distinguishing total coloring of G is called the vertex distinguishing total coloring chromatic number. In a paper, we give a “triangle compositor”, by the compositor, we proved that when n=0(mod 8) and , vertex distinguishing total chromatic number of “ladder graphs” is n.

Packing Chromatic Number of Cycle Related Graphs

2014 ◽  
Vol 4 (1) ◽  
pp. 27
Author(s):  
Albert William ◽  
Roy Santiago ◽  
Indra Rajasingh
Keyword(s):  
Chromatic Number ◽  
Packing Chromatic Number

Packing coloring on subdivision-vertex and subdivision-edge join of cycle Cm with path Pn

2020 ◽  
pp. 627-634
Author(s):  
K. Rajalakshmi ◽  
M. Venkatachalam ◽  
M. Barani ◽  
D. Dafik
Keyword(s):  
Chromatic Number ◽  
Path Graph ◽  
Packing Chromatic Number ◽  
Cycle Graph

The packing chromatic number $\chi_\rho$ of a graph $G$ is the smallest integer $k$ for which there exists a mapping $\pi$ from $V(G)$ to $\{1,2,...,k\}$ such that any two vertices of color $i$ are at distance at least $i+1$. In this paper, the authors find the packing chromatic number of subdivision vertex join of cycle graph with path graph and subdivision edge join of cycle graph with path graph.

scholarly journals On metric chromatic number of comb product of ladder graph

2021 ◽  
Vol 1836 (1) ◽  
pp. 012026
Author(s):  
M Y Rohmatulloh ◽  
Slamin ◽  
A I Kristiana ◽  
Dafik ◽  
R Alfarisi
Keyword(s):  
Chromatic Number ◽  
Ladder Graph
Sign in / Sign up

Export Citation Format

Share Document