OUTER-CLIQUE DOMINATION IN THE CORONA AND CARTESIAN PRODUCT OF GRAPHS

Article Sidebar

PDF
Published: Aug 24, 2018

Main Article Content

Enrico Limbo Enriquez
University of San Carlos
Valerie Verallo Fernandez
University of San Carlos
Jovita N. Ravina
University of San CarlosP

Abstract

Let G  be a simple graph. A set  S of vertices of a graph G is an outer-clique dominating set if every vertex not in S is adjacent to some vertex in S and the subgraph induced by V(G)\S is clique. In this paper, we give the characterization of the outer-clique dominating sets resulting from the corona and Cartesian product of two graphs and give their corresponding outer-clique domination number.

Downloads

Download data is not yet available.

Article Details

How to Cite
Enriquez, E. L., Fernandez, V. V., & Ravina, J. N. (2018). OUTER-CLIQUE DOMINATION IN THE CORONA AND CARTESIAN PRODUCT OF GRAPHS. Journal of Global Research in Mathematical Archives(JGRMA), 5(8), 01–07. Retrieved from https://www.jgrma.com/index.php/jgrma/article/view/501
Issue
Vol. 5 No. 8 (2018): August-2018
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 Biographies

Enrico Limbo Enriquez, University of San Carlos

Associate Professor

Mathematics Department

School of Arts and Sciences

University of San Carlos

Philippines

Valerie Verallo Fernandez, University of San Carlos

Full Instructor

Mathematics Department

School of Arts and Sciences

University of San Carlos

Philippines

Jovita N. Ravina, University of San CarlosP

Full Instructor

Mathematics Department

School of Arts and Sciences

University of San Carlos

Philippines

References

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

M. R. Garey, D. S. Johnson (1979), Computers and Intractability: A Guide to the Theory of NP - Completeness, W.

H. Freeman, ISBN 0-7167-1045-5, p. 190, problem GT2.

E .L. Enriquez, and S. R. Canoy, Jr. On a variant of convex domination in a graph. International Journal of

Mathematical Analysis, 9 (32), 1585-1592. http://dx.doi.org/10.12988/ajma.2015.54127

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, Super Restrained Domination in the Corona of Graphs, International Journal of Latest Engineering

Research and Applications , 3(5), 2018, pp. 1-6.

T. J. Punzalan, and E. L. Enriquez, Inverse Restrained Domination in Graphs, Global Journal of Pure and

Applied Mathematics, 12(3), 2016, pp. 2001-2009.

P. Erdos, G. Szekeres (1935), "A combinatorial problem in geometry" (PDF), Compositio Mathematica, 2: 463-

%2: 463–470.

R.L. Luce, A.D. Perry (1949), "A method of matrix analysis of group structure", Psychometrika, 14 (2):95-116.%14

(2): 95–116, doi:10.1007/BF02289146, PMID 18152948.

T.V. Daniel, and S.R. Canoy,Jr., Clique Domination in a Graph. Applied Mathematical Sciences, Vol. 9, 2015, no. 116,

- 5755. http://dx.doi.org/10.12988/ams.2015.54300

E.L. Enriquez, On Restrained Clique Domination in Graphs, Journal of Global Research in Mathematical Archives,

(12), 2017, pp. 73-77.

E. M. Kiunisala, and E. L. Enriquez, Clique Secure Domination in Graphs. Global Journal of Pure and Applied

Mathematics. Vol. 12, No. 3 (2016), pp. 2075–2084.

C. M. Loquias, E. L. Enriquez, and J. Dayap. Inverse Clique Domination in Graphs. Recoletos Multidisciplinary

Research Journal. Vol. 4, No. 2 (2017), pp 23-34.

R.A. Bacalso, and E .L. Enriquez, On Restrained Clique Domination in Graphs, Journal of Global Research in

Mathematical Archives, Vol. 4, 2017, no. 12, 73-77

J. Cyman, The Outer-connected Domination Number of a graph. Australas. J.Combin., 38(2007), 35-46.

J.N. Ravina, Valerie V. Fernandez, and E.L. Enriquez, Outer-clique Domination in Graphs. Journal of Global Research

In Mathematical Archives, Vol. 5, 2018, no. 7, 102-107

E.L. Enriquez, Secure Restrained Convex Domination in Graphs. International Journal of Mathematical Archive, Vol.

, 2017, no. 7, 1-5.

E. L. Enriquez, and S.R. Canoy,Jr., Restrained Convex Dominating Sets in the Corona and the Products of Graphs.

Applied Products of Graphs. Applied Mathematical Sciences, Vol. 9, 2015, no. 78, 3867 - 3873.

C.M. Loquias and E.L. Enriquez, On Secure Convex and Restrained Convex Domination in Graphs, International

Journal of Applied Engineering Research, Vol. 11, 2016, no. 7, 4707-4710

E.L. Enriquez, Secure restrained domination in the Join and Corona of graphs. Global Journal of Pure and Applied

Mathematics, 12 (1), 507-516

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