Disjoint Fair Domination in Graphs

  IJMTT-book-cover
 
International Journal of Mathematics Trends and Technology (IJMTT)
 
© 2021 by IJMTT Journal
Volume-67 Issue-8
Year of Publication : 2021
Authors : Melodina D. Garol, Enrico L. Enriquez
  10.14445/22315373/IJMTT-V67I8P518

MLA

MLA Style: Melodina D. Garol, Enrico L. Enriquez "Disjoint Fair Domination in Graphs" International Journal of Mathematics Trends and Technology 67.8 (2021):157-163. 

APA Style: Melodina D. Garol, Enrico L. Enriquez(2021). Disjoint Fair Domination in Graphs  International Journal of Mathematics Trends and Technology, 67(8), 157-163.

Abstract
Let G = (V(G), E(G)) be a connected simple graph. A subset S of V(G) is a dominating set of G if for every u ∈ V(G) \ S, there exists v ∈ S such that uv ∈ E(G). A dominating set S is called a fair dominating set if for each distinct vertices u. v ∈ V(G) \ S, | NG(u)∩ S| = |NG(v)∩S|. Further, if D is a minimum fair dominating set of G, then a fair dominating set S ⊆ V(G) \ D is called an inverse fair dominating set of G with respect to D. A disjoint fair dominating set of G is the set C = D ∪ S ⊆ V(G). In this paper, we investigate the concept and give some important results.

Reference

[1] G. Chartrand and P. Zhang, A First Course in Graph Theory, Dover Publication, Inc., New, 2012.
[2] Ore O. Theory of Graphs, American Mathematical Society, Provedence, R.I. 1962
[3] Dayap, J.A. and Enriquez, E.L., Outer-convex domination in graphs, Discrete Mathematics, Algorithms and Applications, 12(01) (2020) 2050008, https://doi.org/10.1142/S1793830920500081
[4] Enriquez, E.L. and Ngujo, A.D., Clique doubly connected domination in the join and lexicographic product of graphs, Discrete Mathematics, Algorithms and Applications, 12(05) (2020) 2050066, https://doi.org/10.1142/S1793830920500664
[5] Enriquez, E.L. and Canoy,Jr., S.R., On a Variant of Convex Domination in a Graph, International Journal of Mathematical Analysis, 9(32) (2015) 1585 - 1592.
[6] Enriquez, E.L. and Canoy,Jr. S.R., Secure Convex Domination in a Graph, International Journal of Mathematical Analysis, 9(7) (2015) 317-325.
[7] M.P. Baldado Jr, E.L. Enriquez, Super secure domination in graphs, International Journal of Mathematical Archive, 8(12) (2017) 145-149.
[8] M.P. Baldado, G.M. Estrada, and E.L. Enriquez, Clique Secure Domination in Graphs Under Some Operations, International Journal of Latest Engineering Research and Applications, 3(6) (2018) 8-14.
[9] E.L. Enriquez, E. Samper-Enriquez, Convex Secure Domination in the Join and Cartesian Product of Graphs, Journal of Global Research in Mathematical Archives, 6(5) (2019) 1-7.
[10] 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, 4(7) (2019) 11-16.
[11] E.L. Enriquez, V. Fernandez, Teodora Punzalan, and Jonecis Dayap, Perfect Outer-connected Domination in the Join and Corona of Graphs, Recoletos Multidisciplinary Research Journal, 4(2) (2016) 1-8.
[12] T.J. Punzalan, and E.L. Enriquez, Restrained Secure Domination in the Join and Corona of Graphs, Journal of Global Research in Mathematical Archives, 5(5) (2018) 1- 6.
[13] C.M. Loquias, and E.L. Enriquez, On Secure Convex and Restrained Convex Domination in Graphs, International Journal of Applied Engineering Research, 11(7) (2016) 4707 - 4710.
[14] E.L. Enriquez, Secure restrained convex domination in graphs, International Journal of Mathematical Archive, 8(7) (2017) 1-5.
[15] B.F. Tubo and S.R. Canoy, Jr., Restrained Perfect Domination in Graphs, International Journal of Mathematical Analysis, 9(25) (2015) 1231 – 1240.
[16] Y. Caro, A. Hansberg and M.A. Henning, Fair Domination in Graphs, University of Haifa, (2011)1-7.
[17] D.P. Galleros, E.L. Enriquez, Fair Restrained Dominating Set in the Corona of Graphs, International Journal of Engineering and Management Research, 10(3) (2020) 110-114.
[18] E.L. Enriquez, Fair Secure Domination in Graphs, International Journal of Mathematics Trends and Technology, 66(2) (2020) 49-57.
[19] E.L Enriquez, Super Fair Dominating Set in Graphs, Journal of Global Research in Mathematical Archives, 6(2) (2019) 8-14
[20] Gomez, L.P. and Enriquez, E.L., Fair Secure Dominating Set in the Corona of Graphs, International Journal of Engineering and Management Research, 10(03) (2020) 115-120.
[21] Enriquez, E.L., Fair Restrained Domination in Graphs, International Journal of Mathematics Trends and Technology, 66(1) (2020) 229-235.
[22] Galleros, DH.P. and Enriquez, E.L., Fair Restrained Dominating Set in the Corona of Graphs, International Journal of Engineering and Management Research, 10(03) (2020) 110 - 114.
[23] V.R. Kulli and S.C. Sigarkanti, Inverse domination in graphs, Nat.Acad. Sci. Letters, 14(1991) 473-475.
[24] E.M. Kiunisala, and E.L. Enriquez, Inverse Secure Restrained Domination in the Join and Corona of Graphs, International Journal of Applied Engineering Research, 11(9) (2016) 6676 - 6679.
[25] T.J. Punzalan, E.L. Enriquez, Inverse Restrained Domination in Graphs, Global Journal of Pure and Applied Mathematics, ISSN 0973-1768, 12(3) (2016) 2001 - 2009.
[26] E.L. Enriquez, E.M. Kiunisala, Inverse Secure Domination in the Join and Corona of Graphs, Global Journal of Pure and Applied Mathematics, ISSN 0973-1768, 12(2) (2016) 1537-1545.
[27] E.L. Enriquez, E.M. Kiunisala, Inverse Secure Domination in Graphs, Global Journal of Pure and Applied Mathematics, ISSN 0973-1768, 12(1) (2016) 147-155.
[28] Salve, D.P. and Enriquez, E.L., Inverse Perfect Domination in the Composition and Cartesian Product of Graphs, Global Journal of Pure and Applied Mathematics, 12(1) (2016) 1-10.
[29] C.M. Loquias, E.L. Enriquez, J.A. Dayap, Inverse Clique Domination in Graphs, Recoletos Multidisciplinary Research Journal, 4(2) (2016) 21-32.
[30] Kiunisala, E.M. and Enriquez, E.L., Inverse Secure Restrained Domination in the Join and Corona of Graphs, International Journal of Applied Engineering Research, 11(9) (2016) 6676-6679.
[31] D.P. Salve and E.L. Enriquez, Inverse Perfect Domination in Graphs, Global Journal of Pure and Applied Mathematics. ISSN 0973-1768, 12(1) (2016) 1-10.
[32] R.C. Alota and E.L. Enriquez, On Disjoint Restrained Domination in Graphs, Global Journal of Pure and Applied Mathematics, ISSN 0973-1768, 12(3) (2016) 2385 – 2394.
[33] J.A. Dayap and E.L. Enriquez, Disjoint Secure Domination in the Join of Graphs, Recoletos Multidisciplinary Research Journal, 4(2) (2016) 9-20.

Keywords : dominating set, fair dominating set, inverse fair dominating set, disjoint fair dominating set