Search
Now showing items 1-1 of 1
On Total r-Dynamic Coloring of Several Classes of Graphs and Their Related Operations
(roceeding The 1st IBSC: Towards The Extended Use Of Basic Science For Enhancing Health, Environment, Energy And Biotechnology, 2017-08-08)
All graphs in this paper are simple, connected and undirected. Let r, k be natural numbers. By a proper
k-coloring of a graph G, we mean a map c : V (G) → S, where |S| = k, such that any two adjacent vertices receive ...