Open AccessGrundy Number of Some Chordal Graphs
Author(s) -
R. Nagarathinam,
N. Parvathi
Publication year - 2018
Publication title -
international journal of engineering and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i4.10.20708
Subject(s) - chordal graph , combinatorics , cartesian product , interval graph , mathematics , pathwidth , graph coloring , indifference graph , edge coloring , discrete mathematics , complete coloring , vertex (graph theory) , graph , 1 planar graph , line graph , graph power
For a given graph G and integer k, the Coloring problem is that of testing whether G has a k-coloring, that is, whether there exists a vertex mapping c : V → {1, 2, . . .} such that c(u) 12≠"> c(v) for every edge uv ∈ E. For proper coloring, colors assigned must be minimum, but for Grundy coloring which should be maximum. In this instance, Grundy numbers of chordal graphs like Cartesian product of two path graphs, join of the path and complete graphs and the line graph of tadpole have been executed