Advances and Applications in Discrete Mathematics
Volume 19, Issue 3, Pages 273 - 288
(July 2018) http://dx.doi.org/10.17654/AADMJul2018_273_288 |
|
CONNECTED SUPER DOMINATION IN GRAPHS
Remilou F. Liguarda and Sergio R. Canoy, Jr.
|
Abstract: Let G be a simple graph. A set is a connected super dominating set if for every there exists an external private neighbor of v with respect to S and the subgraph induced by S is connected. The connected super domination number of G, denoted by is the minimum cardinality of a connected super dominating set in G. A connected super dominating set S of G with is called a -set of G.
In this paper, the connected super dominating sets of some common graphs and the graphs resulting from the join, corona, lexicographic product and Cartesian product of graphs are characterized. Also, the connected super domination numbers of these graphs are determined. |
Keywords and phrases: domination, super domination, connected super domination, join, corona, lexicographic product, Cartesian product. |
|
Number of Downloads: 362 | Number of Views: 4848 |
|