Search
Now showing items 51-53 of 53
On $r$-Dynamic Coloring for Operation Product of Cycle and Cycle Graphs
(2016-02-18)
For integer $k,r>0,(k,r)$ -coloring of graph $G$ is a proper coloring on the vertices of $G$ by $k$-colors such that every vertex $v$ of degree $d(v)$ is adjacent to vertices with at least $min\{d(v),r\}$ different color. ...
On $r$-Dynamic Coloring of Operation Product of Cycle and Path Graphs
(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 ...
Super Antimagicness of Triangular Book and Diamond Ladder Graphs
(Indoms (Indonesian Mathematics Society), Department of Mathematics Universitas Gajah Mada, Indonesia., 2013-11-06)
A graph G of order p and size q is called an (a,
d)-edge-antimagic total if there exists a bijection f : V (G) U E(G)
---> {1, 2, .... , p + q} such that the edge-weights, w(uv) =
f(u)+f(v)+f(uv); uv in E(G), form an ...