International Journal of Mathematics Trends and Technology
Volume 66 | Issue 4 | Year 2020 | Article Id. IJMTT-V66I4P523 | DOI : https://doi.org/10.14445/22315373/IJMTT-V66I4P523
A fair dominating set S ⊆ V(G) is a super fair dominating set ( or SFD-set) if for every u ε V(G) \ S, there exists v ε S such that NG(v) ∩ (V(G)\S) = {u}. The minimum cardinality of an SFD-set, denoted by γsfd(G), is called the super fair domination number of G. In this paper, we characterize the super fair dominating set of the corona and lexicographic product of two graphs.
[1] O. Ore. Theory of Graphs, American Mathematical Society, Provedence, R.I., 1962.
[2] J.A. Dayap and E.L. Enriquez, Outer-convex domination in graphs, Discrete Mathematics, Algorithms and Applications, Vol. 12, No. 01, 2050008 (2020), https://doi.org/10.1142/S1793830920500081
[3] E.L. Enriquez, and S.R. Canoy,Jr., On a Variant of Convex Domination in a Graph, International Journal of Mathematical Analysis, Vol. 9, 2015, no. 32, 1585-1592.
[4] 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.
[5] 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, Vol. 03, Issue 06, 2018, pp 08-14
[6] 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, pp 01-06.
[7] E.M. Kiunisala, and E.L. Enriquez, Inverse Secure Restrained Domination in the Join and Corona of Graphs, International Journal of Applied Engineering Research, Vol. 11, 2016, no. 9, 6676-6679.
[8] 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.
[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, pp 1-7.
[10] E.L. Enriquez, Convex Doubly Connected Domination in Graphs Under Some Binary Operations, Ansari Journal of Ultra Scientist of Engineering and Management, 1(1), 2017, 13-18.
[11] E.L. Enriquez, and S.R. Canoy,Jr., Restrained Convex Dominating Sets in the Corona and the Products of Graphs, Applied Mathematical Sciences, Vol. 9, 2015, no. 78, 3867-3873.
[12] R.N. Hinoguin, and E.L. Enriquez, Weakly Convex Doubly Connected Domination in Graphs Under Some Binary Operations, International Journal of Mathematical Archive, 9(11), 2018, 39-45.
[13] 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, Vol. 04, Issue 07, 2019, pp 11-16.
[14] R.C. Alota, and E.L. Enriquez, On Disjoint Restrained Domination in Graphs, Global Journal of Pure and Applied Mathematics, Vol. 12, 2016, no. 3 pp 2385-2394.
[15] J.L. Ranara, and E.L. Enriquez, Identifying Code of Some Special Graphs, Journal of Global Research in Mathematical Archives, 5(9), 2018, pp. 1-8.
[16] E.L. Enriquez, and E.M. Kiunisala, Inverse Secure Domination in the Join and Corona of Graphs, Global Journal of Pure and Applied Mathematics, 12(2), 1537-1545, 2016.
[17] E.L. Enriquez, Secure Convex Dominating Sets in Corona of Graphs, Applied Mathematical Sciences, 9(120), 5961-5967, 2015.
[18] E.L. Enriquez, and S.R. Canoy, Jr., Secure Convex Dominating Sets in Products of Graphs, Applied Mathematical Sciences, 9(56), 2769-2777, 2015.
[19] E.L. Enriquez, Secure Restrained Domination in the Join and Corona of Graphs, Global Journal of Pure and Applied Mathematics, 12(1), 507-516, 2016.
[20] Y. Caro, A. Hansberg, and M.A. Henning, Fair Domination in Graphs, University of Haifa, 1-7, 2011.
[21] E.L. Enriquez, Fair Restrained Domination in Graphs, International Journal of Mathematics Trends and Technology, 66. 1(2020) 229-235.
[22] E.L. Enriquez, Fair Secure Domination in Graphs, International Journal of Mathematics Trends and Technology, 66. 2(2020) 49-57.
[23] 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.
[24] M.P. Baldado, Jr. and E.L. Enriquez, Super Secure Domination in Graphs, International Journal of Mathematical Archive-8(12), 2017, pp. 145-149.
[25] E.L. Enriquez, Super Convex Dominating Sets in the Corona of Graphs, International Journal of Latest Engineering Research and Applications, Vol. 04, Issue 07, 2019, pp 11-16.
[26] E.L. Enriquez, Super Restrained Domination in the Corona of Graphs, International Journal of Latest Engineering Research and Applications, Vol. 3, 2018, no. 5, 1-6.
[27] E.L. Enriquez, B.P. Fedellaga, C.M. Loquias, G.M. Estrada, M.L. Baterna, Super Connected Domination in Graphs, Journal of Global Research in Mathematical Archives, 6(8), 2019, pp 1-7.
[28] E.L. Enriquez, Super Fair Dominating Set in Graphs, Journal of Global Research in Mathematical Archives Vol. 6, No. 2, 2019, pp. 8-14.
[29] G. Chartrand and P. Zhang, A First Course in Graph Theory, Dover Publication, Inc., New York, 2012.
Enrico L. Enriquez, Glenna T. Gemina, "Super Fair Domination in the Corona and Lexicographic Product of Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 66, no. 4, pp. 203-210, 2020. Crossref, https://doi.org/10.14445/22315373/IJMTT-V66I4P523
PDF 
Abstract 
Keywords 
References 
Citation