Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
ON HARMONIOUS CHROMATIC NUMBER OF C(Tm,n), M(Tm,n), C(L(Tm,n) AND M(L(Tm,n))
View through CrossRef
In this paper, we discuss the harmonious coloring and investigate the harmonious chromatic number of central and middle graph of tadpole graph and harmonious chromatic number of central and middle graph of line graph of tadpole graph, denoted by H(C(Tm,n )), H(M(Tm,n )) and H(C(L(Tm,n ))), H(M(L(Tm,n ))) respectively.
Title: ON HARMONIOUS CHROMATIC NUMBER OF C(Tm,n), M(Tm,n), C(L(Tm,n) AND M(L(Tm,n))
Description:
In this paper, we discuss the harmonious coloring and investigate the harmonious chromatic number of central and middle graph of tadpole graph and harmonious chromatic number of central and middle graph of line graph of tadpole graph, denoted by H(C(Tm,n )), H(M(Tm,n )) and H(C(L(Tm,n ))), H(M(L(Tm,n ))) respectively.
Related Results
BILANGAN KROMATIK EQUITABLE PADA GRAF BINTANG, GRAF LOLIPOP, DAN GRAF PERSAHABATAN
BILANGAN KROMATIK EQUITABLE PADA GRAF BINTANG, GRAF LOLIPOP, DAN GRAF PERSAHABATAN
Let G be a connected and undirected graph. Vertex coloring in a graph G is a mapping from the set of vertices in G to the set of colors such that every two adjacent vertices have d...
On the Chromatic Number of Cycle Books Graph
On the Chromatic Number of Cycle Books Graph
Graph coloring is a fundamental topic in graph theory, with various applications in scheduling, networking, and optimization problems. In this study, we investigate the chromatic n...
Burning, edge burning & chromatic burning classification of some graph family
Burning, edge burning & chromatic burning classification of some graph family
Graph ‘G’ is a Simple and undirected graph, which has a lowest number of color that is required to color the edge is called chromatic index. It is denoted by the symbol χ1(G). In ...
Proper Injective Coloring Parameters of Some Wheel-Related Graphs
Proper Injective Coloring Parameters of Some Wheel-Related Graphs
Any vertex coloring protocol of a graph can be viewed as a random experiment of assigning colors to the vertices, such that the random variable of this experiment is the number of ...
Spectral Discrimination in “Color Blind” Animals via Chromatic Aberration and Pupil Shape
Spectral Discrimination in “Color Blind” Animals via Chromatic Aberration and Pupil Shape
AbstractWe present a mechanism by which organisms with only a single photoreceptor, that have a monochromatic view of the world, can achieve color discrimination. The combination o...
Bilangan Kromatik Lokasi pada Graf Hasil Amalgamasi Sisi dari Graf Bintang dan Graf Lengkap
Bilangan Kromatik Lokasi pada Graf Hasil Amalgamasi Sisi dari Graf Bintang dan Graf Lengkap
The locating coloring of graph extends the vertex coloring dan partition dimension of graph. The minimum number of locating coloring of graph G is called the locating chromatic num...
The Locating-Chromatic Number of Origami Graphs
The Locating-Chromatic Number of Origami Graphs
The locating-chromatic number of a graph combines two graph concepts, namely coloring vertices and partition dimension of a graph. The locating-chromatic number is the smallest k s...
Chromatic Quantum Contextuality
Chromatic Quantum Contextuality
Chromatic quantum contextuality is a criterion of quantum nonclassicality based on (hyper)graph coloring constraints. If a quantum hypergraph requires more colors than the number o...