RESULTS ON GRUNDY CHROMATIC NUMBER OF JOIN GRAPH OF GRAPHS
R. Stella Maragatham, Arunkumar Subramanian
Abstract
Open-access reader
R. Stella Maragatham, Arunkumar Subramanian
Abstract
Open-access reader
The Grundy number of a graph G, denoted by $\Gamma(G)$ is the largest k such that G has a greedy k-coloring, that is a coloring with k colors obtained by applying the greedy algorithm according to some ordering of the vertices of G. In this paper, we obtain the Grundy chromatic number of join graph of path graph, complete bipartite graph, fan graph, cycle graph, complete graph, wheel graph and gear graph. Received: February 11, 2023 Revised: May 16, 2023 Accepted: June 6, 2023
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The Grundy number of a graph G, denoted by $\Gamma(G)$ is the largest k such that G has a greedy k-coloring, that is a coloring with k colors obtained by applying the greedy algorithm according to some ordering of the vertices of G. In this paper, we obtain the Grundy chromatic number of join graph of path graph, complete bipartite graph, fan graph, cycle graph, complete graph, wheel graph and gear graph. Received: February 11, 2023 Revised: May 16, 2023 Accepted: June 6, 2023
Key concepts: Combinatorics, Windmill graph, Butterfly graph, Graph power, Simplex graph, Wheel graph, Mathematics, Voltage graph