On Some Operations of Secure Restrained Convex Domination in Graphs

Article Sidebar

PDF
Published: Nov 13, 2017

Main Article Content

Enrico Limbo Enriquez
University of San Carlos

Abstract

Let  be a connected simple graph. A restrained convex dominating set  in a connected graph  is a secure restrained convex dominating set, if for each element  in  there exists an element  in  such that  and  is a restrained convex dominating set.  The secure restrained convex domination number of , denoted by , is the minimum cardinality of a secure restrained convex dominating set in . A secure restrained convex dominating set of cardinality  will be called a -. In this paper, we characterize the secure restrained convex dominating sets in the corona, composition, and Cartesian products of two graphs and give some important results.

Downloads

Download data is not yet available.

Article Details

How to Cite
Enriquez, E. L. (2017). On Some Operations of Secure Restrained Convex Domination in Graphs. Journal of Global Research in Mathematical Archives(JGRMA), 4(11), 30–36. Retrieved from https://jgrma.com/index.php/jgrma/article/view/353
Issue
Vol. 4 No. 11 (2017): November-2017
Section
Research Paper

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

Author Biography

Enrico Limbo Enriquez, University of San Carlos

Associate Professor

Mathematics Department

University of San Carlos

Philippines

References

E.L. Enriquez, Secure Restrained Convex Domination in Graphs. International Journal of Mathematical Archive, Vol. 8, 2017, no. 7, 1-5.

E.L. Enriquez, and S.R. Canoy,Jr., Secure Convex Domination in a Graph. International Journal of Mathematical Analysis, Vol. 9, 2015, no. 7, 317-325.

E.L. Enriquez, Secure Convex Dominating Sets in Corona of Graphs. Applied Mathematical Sciences, Vol. 9, 2015, no. 120, 5961-5967.

E. Enriquez. S.R. Canoy, Jr., Secure Convex Dominating Sets in Products of Graphs. Applied Mathematica Sciences, Vol 9, 2015, no. 56, 2769-2777.

E.J. Cockayne, and S.T. Hedetniemi Towards a theory of domination in graphs, Networks, (1977) 247-261.

E.J. Cockayne, O. Favaron and C.M. Mynhardt Secure domination, weak Roman domination and forbidden subgraphs, Bull. Inst. Combin. Appl. 39(2003) 87-100.

G. Chartrand and P. Zhang, A First Course in Graph Theory. Dover Publication, Inc., New York, 2012.

G. Chartrand, and P. Zhang, Convex Sets in Graphs. Congressus Numerantium, 136 (1999), 19-32.

G.S. Domke, J.H. Hattingh, M.A. Henning, L.R. Markus, Restrained Domination in Graphs with Minimum Degree two, J. Combin. Math. Combin. Comput. 35(2000) 239-254.

J.A. Telle, A. Proskurowski, Algorithms for Vertex Partitioning Problems on Partial-k Trees, SIAM J. Discrete Mathematics, 10(1997), 529-550.

M.A. Labendia, S.R. Canoy, Jr., Convex Domination in the Composition and Cartesian Product of Graphs, Czechoslovak Mathematical Journal, 62(2012), 1003-1009.

O. Ore. Theory of Graphs. American Mathematical Society, Provedence, R.I., 1962.

P.R. Pushpam, and C. Suseendran, Secure Restrained Domination in Graphs. Math.Comput.Sci, (2015)9:239-247.