On a variant of convex domination in a graph

Open

Enrico L. Enriquez, Sergio R. Canoy

2015 International Journal of Mathematical Analysis Vol. 9 Issue 29-32 Article Cited by 11 Quartile

Abstract

A dominating set S which is also convex is called a convex dominating set of G. A convex dominating set S of V (G) is a restrained convex dominating set of G if for each u ε V (G) \ S, there exists z ε V (G) \ S such that uz ε E(G). The minimum cardinality of a restrained convex dominating set of G, denoted by γrcon(G), is called the restrained convex domination number of G. In this paper we investigate the concept and give some important results. © 2015 Enrico L. Enriquez and Sergio R. Canoy, Jr.

Affiliations

Department of Mathematics, College of Arts and Sciences, University of San Carlos, Cebu City, 6000, Philippines; Department of Mathematics and Statistics, Mindanao State University-Iligan Institute of Technology, Tibanga Highway, Iligan City, 9200, Philippines