Super Fair Dominating Set in the Cartesian Product of Graphs

  • Glenna T. Gemina
  • Enrico L. Enriquez
Keywords: Fair Dominating Set, Super Dominating Set, Super Fair Dominating Set, Cartesian Product

Abstract

In this paper, we characterize the super fair dominating set in the Cartesian product of two graphs and give some important results.

Downloads

Download data is not yet available.

References

O. Ore. (1962). Theory of graphs. American Mathematical Society Colloquiun Publications, Provedence, R.I.

J.A. Dayap & E.L. Enriquez. (2020). Outer-convex domination in graphs. Discrete Mathematics, Algorithms and Applications, 12(01), 2050008. Available at: https://doi.org/10.1142/S1793830920500081

E.L. Enriquez & S.R. Canoy, Jr. (2015). On a variant of convex domination in a graph. International Journal of Mathematical Analysis, 9(32), 1585-1592.

E.L. Enriquez & S.R. Canoy, Jr. (2015). Secure convex domination in a graph. International Journal of Mathematical Analysis, 9(7), 317-325.

M.P. Baldado, G.M. Estrada, & E.L. Enriquez. (2018). Clique secure domination in graphs under some operations. International Journal of Latest Engineering Research and Applications, 03(06), 08-14.

T.J. Punzalan & E.L. Enriquez. (2018). Restrained secure domination in the join and corona of graphs. Journal of Global Research in Mathematical Archives, 5(5), 01-06.

E.M. Kiunisala & E.L. Enriquez. (2016). Inverse secure restrained domination in the join and corona of graphs. International Journal of Applied Engineering Research, 11(9), 6676-6679.

C.M. Loquias & E.L. Enriquez. (2016). On secure convex and restrained convex domination in graphs. International Journal of Applied Engineering Research, 11(7), 4707-4710.

E.L. Enriquez & E. Samper-Enriquez. (2019). Convex secure domination in the join and cartesian product of graphs. Journal of Global Research in Mathematical Archives, 6(5), 1-7.

E.L. Enriquez. (2017). Convex doubly connected domination in graphs under some binary operations. Ansari Journal of Ultra Scientist of Engineering and Management, 1(1), 13-18.

E.L. Enriquez & S.R. Canoy, Jr. (2015). Restrained convex dominating sets in the corona and the products of graphs. Applied Mathematical Sciences, 9(78), 3867-3873.

R.N. Hinoguin & E.L. Enriquez. (2018). Weakly convex doubly connected domination in graphs under some binary operations. International Journal of Mathematical Archive, 9(11), 39-45.

G.M. Estrada, C.M. Loquias, E.L. Enriquez, and C.S. Baraca, Perfect Doubly Connected Domination in the Join and Corona of Graphs. International Journal of Latest Engineering Research and Applications, 04(07), 11-16.

R.C. Alota & E.L. Enriquez. (2016). On disjoint restrained domination in graphs. Global Journal of Pure and Applied Mathematics, 12(3), 2385-2394.

Y. Caro, A. Hansberg, & M.A. Henning. (2011). Fair domination in graphs. University of Haifa, 1-7.

E.L. Enriquez. (2020). Fair restrained domination in graphs. International Journal of Mathematics Trends and Technology, 66(1), 229-235.

E.L. Enriquez. (2020). Fair secure domination in graphs. International Journal of Mathematics Trends and Technology, 66(2), 49-57.

M. Lemanska, V. Swaminathan, Y.B. Venkatakrishnan, & R. Zuazua. (2015). Super dominating sets in graphs. Proceedings of the National Academy of Sciences, 85(3), 353-357.

M.P. Baldado, Jr. & E.L. Enriquez. (2017). Super secure domination in graphs. International Journal of Mathematical Archive, 8(12), 145-149.

E.L. Enriquez. (2019). Super convex dominating sets in the corona of graphs. International Journal of Latest Engineering Research and Applications, 04(07), 11-16.

E.L. Enriquez. (2018). Super restrained domination in the corona of graphs. International Journal of Latest Engineering Research and Applications, 3(5), 1-6.

E.L. Enriquez, B.P. Fedellaga, C.M. Loquias, G.M. Estrada, & M.L. Baterna. (2019). Super connected domination in graphs. Journal of Global Research in Mathematical Archives, 6(8), 1-7.

E.L. Enriquez. (2019). Super fair dominating set in graphs. Journal of Global Research in Mathematical Archives, 6(2), 8-14.

G. Chartrand & P. Zhang. (2012). A first course in graph theory. New York: Dover Publication, Inc.

Published
2020-06-30
How to Cite
Glenna T. Gemina, & Enrico L. Enriquez. (2020). Super Fair Dominating Set in the Cartesian Product of Graphs. International Journal of Engineering and Management Research, 10(3), 7-11. https://doi.org/10.31033/ijemr.10.3.2
Section
Articles