“...A graph  in this paper is nontrivial, finite, connected, simple, and undirected. Graph  consists...”
Get full text

“...Let $G$ be a simple, connected and undirected graph. Let $r,k$ be natural number. By a proper $k...”
Get full text

“...Let and be two simple, nontrivial and undirected graphs. Let be a vertex of , the comb product...”
Get full text

“...Let L and H be two simple, nontrivial and undirected graphs. Let o be a vertex of H, the comb...”
Get full text