SUPER WEAKLY CONVEX DOMINATION IN GRAPHS

Article Sidebar

PDF
Published: Nov 24, 2019

Main Article Content

Enrico Limbo Enriquez
University of San Carlos
Reuella J Awayan Bacalso
University of San Carlos

Abstract

: Let be a simple graph. A a weakly convex dominating set of is called super weakly convex dominating set of  if for every vertex there exists a vertexsuch thatThe minimum cardinality of a super weakly convex dominating set of denoted by  is called the super weakly convex domination number of  In this paper, we initiate the study of the concept and give the domination number of some special graphs. Further, we characterize the super convex dominating set in join of two graphs.

Downloads

Download data is not yet available.

Article Details

How to Cite
Enriquez, E. L., & Bacalso, R. J. A. (2019). SUPER WEAKLY CONVEX DOMINATION IN GRAPHS. Journal of Global Research in Mathematical Archives(JGRMA), 6(11), 01–07. Retrieved from https://www.jgrma.com/index.php/jgrma/article/view/546
Issue
Vol. 6 No. 11 (2019): November-2019
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

University of San Carlos

Philippines

Reuella J Awayan Bacalso, University of San Carlos

Assistant Professor

Mathematics Department

University of San Carlos

Philippines

References

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

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

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

M. P. Baldado, G.M. Estrada, E.L. Enriquez Clique Secure Domination in Graphs Under Some Binary Operations,

International Journal of Latest Engineering Research and Application, Vol. 03, No. 06 (2018), 08-14.

T.J. Punzalan, E.L. Enriquez Restrained Secure Domination in the Join and Corona of Graphs, Journal of Global

Research in Mathematical Archives, Vol. 5, No. 5 (2018), 1-6

V.V. Fernandez, J.N. Ravina, E.L. Enriquez Outer Clique Domination in the Corona and Cartesian Product of Graphs, Vol.

, No. 8 (2018), 1-7.

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

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

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

Archives, Vol. 4, No. 12 (2017), 73-77.

M. Lemanska, Weakly convex and convex domination numbers}, Opuscula Mathematica, 24 (2004), 181-188.

R.T. Aunzo, and E.L. Enriquez, Convex Doubly Connected Domination in Graphs. Applied Mathematical Sciences, Vol.

, 2015, no. 135, 6723-6734.

E.L. Enriquez, E.S. Enriquez Convex Secure Domination in the Join and Cartesian Product of Graphs, Journal of Global

Research in Mathematical Archives, Vol. 6, No. 5 (2019), 1-7

G.M. Estrada, C.M. Loquias, E.L. Enriquez, R.N. Hinoguin Weakly Convex Doubly Connected Domination in the Join

and Corona of Graphs, Journal of Global Research in Mathematical Archives, Vol. 5, No. 6 (2018), 1-6

J.A. Dayap, E.L. Enriquez Outer-convex Domination in the Composition and Cartesian Product of Graphs, Journal of

Global Research in Mathematical Archives, Vol. 6, No. 3 (2019), 34-42.

E.L. Enriquez Secure Convex Dominating Sets in Corona of Graphs, Applied Mathematical Sciences, Vol. 9, No. 120

(2015), 5961-5967.

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, 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, Secure Restrained Convex Domination in Graphs, International Journal of Mathematical Archive, Vol.

, 2017, no. 7, 1-5.

M. Lemanska, V. Swaminathan, Y.B. Venkatakrishnan, R. Zuazua, Super Dominating sets in graphs. Proceedings of the

National Academy of Sciences, Vol. 85, 2015, no. 3, 353-357.

E.L. Enriquez Super Fair Dominating Set in Graphs, Journal of Global Research in Mathematical Archives, Vol. 6, No.

(2019), 08-14.

E.L. Enriquez Super Restrained Domination in the Corona of Graphs, International Journal of Latest Engineering

Research and Application, Vol. 03, No. 05 (2018), 1-6.

M.P. Baldado, Jr. and E.L. Enriquez, Super Secure Domination in Graphs, International Journal of Mathematical

Archive-8(12), 2017, pp. 145-149

S. Lipschutz, Shaum's Outline of Theory and Problems of General Topology, McGraw-Hill Inc., Singapore, 1965.

Most read articles by the same author(s)

1 2 > >>