Advances and Applications in Discrete Mathematics
Volume 19, Issue 4, Pages 373 - 390
(October 2018) http://dx.doi.org/10.17654/AADMOct2018_373_390 |
|
INTERIOR TOTAL DOMINATING SETS IN GRAPHS
Shiela Mae B. Pacardo and Helen M. Rara
|
Abstract: Let G = (V(G), E(G))be a simple graph. A total dominating set D of V(G) is an interior total dominating set of G if every is an interior vertex of G. The minimum cardinality of an interior total dominating set of G, denoted by is called an interior total domination number of G.
In this paper, we characterize the interior total dominating sets of the join, corona, lexicographic and Cartesian products of graphs and determine the corresponding interior total domination number of these graphs. |
Keywords and phrases: interior domination, total domination, join, corona, lexicographic product, Cartesian product.
|
|
Number of Downloads: 301 | Number of Views: 4671 |
|