CONVEX SECURE DOMINATIONIN THE JOIN AND CARTESIAN PRODUCT OF GRAPHS
Main Article Content
Abstract
Let be a connected simple graph. A convex dominating set of is a convex secure dominating set, if for each element there exists an element such that and is a dominating set. The convex secure domination number denoted by is the minimum cardinality of a convex secure dominating set of cardinality will be called a - In this paper, we investigate the concept and give some important results on convex secure dominating sets in the join and Cartesian product of two graphs.
Â
Mathematics Subject Classification: 05C69
Â
Keywords: dominating set, convex dominating set, convex secure dominating set
Downloads
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Open Access: This is an open-access journal. All articles published in the Journal of Global Research in Mathematical Archives(JGRMA) are made immediately and permanently available under the Creative Commons Attribution 4.0 International (CC BY 4.0) License. Authors retain the copyright of their work and grant Journal of Global Research in Mathematical Archives(JGRMA) the right of first publication. This license permits unrestricted use, distribution, adaptation, and reproduction in any medium or format, including commercial use, provided the original author(s), source, and license are properly acknowledged.
Google Scholar Indexed | DOI Enabled | OAI-PMH Compliant | Open Access Journal