Convex Doubly Connected Domination in Graphs Under Some Binary Operations
Author & Affiliation:
ENRICO L. ENRIQUEZ ([email protected])
Mathematics Department, University of San Carlos (Philippines)
Keyword:
domination doubly connected dominating set, convex dominating set, convex doubly connected dominating set
Issue Date:
October, 2017
Abstract:
Let be a connected simple graph. A set ⊆ () is a doubly connected dominating set if it is dominating and both 〈 〉 and 〈 () 〉 are connected. A convex dominating set of is a convex doubly connected dominating set if is a doubly connected dominating set of . The convex doubly connected
domination number of , denoted by (), is the smallest cardinality of a convex doubly connected dominating set of . In this paper, we characterize the convex doubly connected dominating sets in the lexicographic and Cartesian product of two graphs and give some important results.
Pages:
13-18
ISSN:
.-- (Online) - -- (Print)
Source:
PDF:
Click here to download full paper
DOI:
http://dx.doi.org/
Copy the following to cite this article:
L. E. Enriquez , "Convex Doubly Connected Domination in Graphs Under Some Binary Operations", Ansari Journal of Ultra Scientist of Engineering and Management, Volume 1, Issue 1, Page Number 13-18, 2017Copy the following to cite this URL:
L. E. Enriquez , "Convex Doubly Connected Domination in Graphs Under Some Binary Operations", Ansari Journal of Ultra Scientist of Engineering and Management, Volume 1, Issue 1, Page Number 13-18, 2017Available from: http://www.enggandmgtjournal.org/paper/6/convex-doubly-connected-domination-in-graphs-under-some-binary-operations