THE HARMONIOUS CHROMATIC NUMBER OF A COLLECTION OF WHEEL GRAPHS

2016 ◽  
Vol 100 (9) ◽  
pp. 1487-1503
Author(s):  
W. Charoenpanitseri ◽  
P. Chanthaweeroj
Keyword(s):  
Chromatic Number ◽  
Wheel Graphs

A Note on the b-Chromatic Number of Corona of Graphs

2015 ◽  
Vol 15 (01n02) ◽  
pp. 1550004 ◽  
Author(s):  
P. C. LISNA ◽  
M. S. SUNITHA
Keyword(s):  
Chromatic Number ◽  
Proper Coloring ◽  
Chromatic Numbers ◽  
Star Graphs ◽  
Color Class ◽  
Wheel Graphs

A b-coloring of a graph G is a proper coloring of the vertices of G such that there exists a vertex in each color class joined to at least one vertex in each other color classes. The b-chromatic number of a graph G, denoted by [Formula: see text], is the maximal integer k such that G has a b-coloring with k colors. In this paper, the b-chromatic numbers of the coronas of cycles, star graphs and wheel graphs with different numbers of vertices, respectively, are obtained. Also the bounds for the b-chromatic number of corona of any two graphs is discussed.

On injective chromatic polynomials of graphs

2015 ◽  
Vol 07 (03) ◽  
pp. 1550035
Author(s):  
Anjaly Kishore ◽  
M. S. Sunitha
Keyword(s):  
Chromatic Number ◽  
Discrete Math ◽  
Chromatic Polynomial ◽  
Complete Graphs ◽  
Common Neighbor ◽  
Chromatic Polynomials ◽  
Wheel Graphs ◽  
Minimum Number

The injective chromatic number χi(G) [G. Hahn, J. Kratochvil, J. Siran and D. Sotteau, On the injective chromatic number of graphs, Discrete Math. 256(1–2) (2002) 179–192] of a graph G is the minimum number of colors needed to color the vertices of G such that two vertices with a common neighbor are assigned distinct colors. The nature of the coefficients of injective chromatic polynomials of complete graphs, wheel graphs and cycles is studied. Injective chromatic polynomial on operations like union, join, product and corona of graphs is obtained.

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

A STUDY ON ZERO-M CORDIAL LABELING

2020 ◽  
Vol 9 (11) ◽  
pp. 9207-9218
Author(s):  
A. Neerajah ◽  
P. Subramanian
Keyword(s):  
Wheel Graphs

A labeling $f: E(G) \rightarrow \{1, -1\}$ of a graph G is called zero-M-cordial, if for each vertex v, the arithmetic sum of the labels occurrence with it is zero and $|e_{f}(-1) - e_{f}(1)| \leq 1$. A graph G is said to be Zero-M-cordial if a Zero-M-cordial label is given. Here the exploration of zero - M cordial labelings for deeds of paths, cycles, wheel and combining two wheel graphs, two Gear graphs, two Helm graphs. Here, also perceived that a zero-M-cordial labeling of a graph need not be a H-cordial labeling.

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