|
|
 |
| |
|
|
|
Roman and Inverse Roman Domination in Hexagonal Systems |
|
|
|
PP: 1-6 |
|
|
|
Author(s) |
|
|
|
M. Kamal Kumar,
Prakash Chandra Mittal,
Manisha Gupta,
Zulfiqar Zaman,
TusharPradip Atole,
|
|
|
|
Abstract |
|
|
| In the recent past the field graph theory have grown exponential due to its various application in the real life systems. Among the various sub field in graph theory domination theory in graphs has its special place for its interesting and vast application in networking and other advance field of sciences. Among various types of domination, Roman dominating function is defined as f : V (G) → {0, 1, 2} satisfying the condition that ∀u ∈ V , f (u) = 0, ∃v ∈ V , f (v) = 2 and d(u v) = 1. If V − D contains a Roman dominating function f 1 . Where “D” is the set of all vertices v for which f (v) > 0. Then f 1 is called the Inverse Roman dominating function on a graph G(V,E) with respect to Roman dominating function f, in this paper Roman Domination Number and Inverse Roman Dominating Number in hexagonal system is obtained.
|
|
|
|
|
|
|
|
