Now showing items 1-1 of 1

    • On $r$-dynamic Coloring of Operation Product of Cycle and Path Graphs 

      D.E.W. Meganingtyas, Dafik, Slamin (2016-02-18)
      Let $G$ be a simple, connected and undirected graph. Let $r,k$ be natural numbers. By a proper $k$-coloring of a graph $G$, we mean a map $ c : V (G) \rightarrow S$, where $|S| = k$, such that any two adjacent vertices ...