Let G be a connected graph which is nontrivial, defined a coloring c: V(G)→ {1, 2,…., k}, k ∈N of the vertices of G. A rainbow dynamic coloring of a graph is adynamic coloring and minimum number of colors required, such that every pair ofvertices is connected by at least one path whose within vertices have different colors. Further, G is said to be star-rainbow dynamic colored if every path on four
vertices in it is rainbow dynamic colored. The minimum k for which there exist a k-vertex coloring called the star rainbow dynamic coloring of G, denoted by strrdyc(G). In this paper we determine some corona product graphs involving Petersen graph, path and complete graph, path and star graph and star and complete graph and find strrdyc(G) for such graphs.
Author (s) Details
Gayathri Annasagaram
Dayananfda Sagar Academy of Technology and Management, Bengaluru, Affiliated to Visvesvaraya Technological University Belagavi 590018, India.
R Murali
Dr. Ambedkar Institute of Technology, Bengaluru, Affiliated to Visvesvaraya Technological University Belagavi 590018, India.
Kulkarni Sunita Jagganathararao
Dr. Ambedkar Institute of Technology, Bengaluru, Affiliated to Visvesvaraya Technological University Belagavi 590018, India.
Please see the book here:- https://doi.org/10.9734/bpi/mono/978-93-49238-47-3/CH32
No comments:
Post a Comment