...

  • Home
  • Articles
    • Current Issue
    • Archives
  • Authors
    • Author Guidelines
    • Policies
    • Downloads
  • Editors
  • Reviewers
...

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 69 | Issue 12 | Year 2023 | Article Id. IJMTT-V69I12P505 | DOI : https://doi.org/10.14445/22315373/IJMTT-V69I12P505

Fair Doubly Connected Domination in the Corona and the Cartesian Product of Two Graphs


Jan Niรฑo C. Serrano, Enrico L. Enriquez
Received Revised Accepted Published
25 Oct 2023 02 Dec 2023 15 Jan 2024 31 Dec 2023
Abstract

Let ๐บ be a nontrivial connected graph. A dominating set ๐‘† โІ ๐‘‰(๐บ) is called a doubly connected dominating set of ๐บ if both โŸจ๐‘†โŸฉ and โŸจ๐‘‰(๐บ)\๐‘†โŸฉ are connected. If every distinct vertices ๐‘ข and v from ๐‘‰(๐บ)\๐‘†, |๐‘๐บ (๐‘ข) โˆฉ ๐‘†| = |๐‘๐บ (๐‘ฃ) โˆฉ ๐‘†|, then ๐‘† is called a fair doubly connected dominating set of ๐บ. Furthermore, the fair doubly connected domination number, denoted by ฮณ๐‘“๐‘๐‘(๐บ), is the minimum cardinality of a fair doubly connected dominating set of G. A fair doubly connected dominating set of cardinality ๐›พ๐‘“๐‘๐‘(๐บ) is called ๐›พ๐‘“๐‘๐‘-set. In this paper, we characterized the fair doubly connected domination in the corona and Cartesian product of two graphs and give some important results

Keywords

Dominating set, Doubly connected dominating set, Fair dominating set, Fair doubly connected dominating set.

References

[1] Oystein Ore, Theory of Graphs, American Mathematical Society, pp. 1-270, 1962.
[Google Scholar] [Publisher Link]
[2] E.J. Cockayne, and S.T. Hedetnieme, โ€œTowards a Theory of Domination in Graphs,โ€ Networks, vol. 7, no. 3, pp. 247-261, 1977.
[CrossRef] [Google Scholar] [Publisher Link]
[3] Nanet Altubar Goles, Carmelita N. Loquias, and Grace M. Estrada, โ€œZ-Domination in Graphs,โ€ Journal of Global Research in Mathematical Archives, vol. 5, no. 11, pp. 7-12, 2018.
[Google Scholar] [Publisher Link]
[4] Valerie V. Fernandez, Jovita N. Ravina, and Enrico L. Enriquez, โ€œOuter-Clique Domination in the Corona and Cartesian Product of Graphs,โ€ Journal of Global Research in Mathematical Archives, vol. 5, no. 8, pp. 1-7, 2018.
[Google Scholar] [Publisher Link]
[5] E.L. Enriquez et al., โ€œClique Doubly Connected Domination in the Corona and Cartesian Product of Graphs,โ€ Journal of Global Research in Mathematical Archives, vol. 6, no. 9, pp. 1-5, 2019.
[Google Scholar] [Publisher Link]
[6] Grace M. Estrada et al., โ€œWeakly Convex Doubly Connected Domination in the Join and Corona of Graphs,โ€ Journal of Global Research in Mathematical Archives, vol. 5, no. 6, pp. 1-6, 2018.
[Google Scholar] [Publisher Link]
[7] Jonecis A. Dayap, and Enrico L. Enriquez, โ€œOuter-Convex Domination in Graphs in the Composition and Cartesian Product of Graphs,โ€ Journal of Global Research in Mathematical Archives, vol. 6, no. 3, pp. 34-42, 2019.
[Google Scholar] [Publisher Link]
[8] Daisy P. Salve, and Enrico L. Enriquez, Inverse Perfect Domination in the Composition and Cartesian Product of Graphs, Global Journal of Pure and Applied Mathematics, 12(1), 2016, pp 1-10.
[Publisher Link]
[9] Bea Elaine Fedellaga et al., โ€œSuper Connected Domination in Graphs,โ€ Journal of Global Research in Mathematical Archives, vol. 6, no. 8, pp. 1-7, 2019.
[Google Scholar] [Publisher Link]
[10] Reuella J A. Bacalso, and Enrico L. Enriquez, โ€œOn Restrained Clique Domination in Graphs,โ€ Journal of Global Research in Mathematical Archives, vol. 4, no. 12, pp. 73-77, 2017.
[Google Scholar] [Publisher Link]
[11] Enrico L. Enriquez, โ€œSuper Restrained Domination in the Corona of Graphs,โ€ International Journal of Latest Engineering Research and Applications, vol. 3, no. 5, pp. 1-6, 2018.
[Google Scholar] [Publisher Link]
[12] Teodora J. Punzalan, and Enrico L. Enriquez, โ€œInverse Restrained Domination in Graphs,โ€ Global Journal of Pure and Applied Mathematics, vol. 12, no. 3, pp. 2001โ€“2009, 2016.
[Google Scholar] [Publisher Link]
[13] Romeo C. Alota, and Enrico L. Enriquez, โ€œOn Disjoint Restrained Domination in Graphs,โ€ Global Journal of Pure and Applied Mathematics, vol. 12, no.3 pp. 2385-2394, 2016.
[Google Scholar] [Publisher Link]
[14] Enrico L. Enriquez, and Jr. Sergio R. Canoy, โ€œOn a Variant of Convex Domination in a Graph,โ€ International Journal of Mathematical Analysis, vol. 9, no. 32, pp. 1585-1592, 2015.
[CrossRef] [Google Scholar] [Publisher Link]
[15] Enrico L. Enriquez, and Evelyn Samper-Enriquez, โ€œConvex Secure Domination in the Join and Cartesian Product of Graphs,โ€ Journal of Global Research in Mathematical Archives, vol. 6, no. 5, pp. 1-7, 2019.
[Google Scholar] [Publisher Link]
[16] Enrico L. Enriquez, and Jr. Sergio R. Canoy, โ€œSecure Convex Domination in a Graph,โ€ International Journal of Mathematics Analysis, vol. 9, no. 7, pp. 317-325, 2015.
[CrossRef] [Google Scholar] [Publisher Link]
[17] Carmelita M. Loquias, and Enrico L. Enriquez, โ€œOn Secure Convex and Restrained Convex Domination in Graphs,โ€ International Journal of Applied Engineering Research, vol. 11, no. 7, pp. 4707-4710, 2016.
[Google Scholar] [Publisher Link]
[18] Enrico L. Enriquez, and Jr. Sergio R. Canoy, โ€œRestrained Convex Dominating Sets in the Corona and the Products of Graphs,โ€ Applied Mathematical Sciences, vol. 9, no. 78, pp. 3867-3873, 2015.
[Google Scholar] [Publisher Link]
[19] Enrico L. Enriquez, โ€œSecure Restrained Convex Domination in Graphs,โ€ International Journal of Mathematical Archive, vol. 8, no. 7, pp. 1-5, 2017.
[Google Scholar] [Publisher Link]
[20] Jr. Michael P. Baldado, and Enrico L. Enriquez, โ€œSuper Secure Domination in Graphs,โ€ International Journal of Mathematical Archive, vol. 8, no. 12, pp. 145-149, 2017.
[Google Scholar] [Publisher Link]
[21] Edward M. Kiunisala, and Enrico L. Enriquez, โ€œInverse Secure Restrained Domination in the Join and Corona of Graphs,โ€ International Journal of Applied Engineering Research, vol. 11, no. 9, pp. 6676-6679, 2016.
[Google Scholar] [Publisher Link]
[22] Stephen Paul G. Cajigas et al., โ€œDisjoint Restrained Domination in the Join and Corona of Graphs,โ€ International Journal of Mathematics Trends and Technology, vol. 67, no. 12, pp. 57-61, 2021.
[CrossRef] [Google Scholar] [Publisher Link]
[23] Hemeh Luck M. Maravillas, and Enrico L. Enriquez, โ€œSecure Super Domination in Graphs,โ€ International Journal of Mathematics Trends and Technology, vol. 67, no.8, pp. 38-44, 2021.
[CrossRef] [Google Scholar] [Publisher Link]
[24] James A. Ortega, and Enrico L. Enriquez, โ€œSuper Inverse Domination in Graphs,โ€ International Journal of Mathematics Trends and Technology, vol. 67, no. 7, pp. 135-140, 2021.
[CrossRef] [Google Scholar] [Publisher Link]
[25] Joanna Cyman, Magdalena Lemaล„ska, and Joanna Raczek, โ€œOn the Doubly Connected Domination Number of a Graph,โ€ Central European Journal of Mathematics, vol. 4, pp. 34-45, 2006.
[CrossRef] [Google Scholar] [Publisher Link]
[26] Jr. Rodulfo T. Aunzo, and Enrico L. Enriquez, โ€œConvex Doubly Connected Domination in Graphs,โ€ Applied Mathematical Sciences, vol. 9, no. 135, pp. 6723-6734, 2015.
[CrossRef] [Google Scholar] [Publisher Link]
[27] Enrico L. Enriquez, โ€œConvex Doubly Connected Domination in Graphs under Some Binary Operations,โ€ Ansari Journal of Ultra Scientist of Engineering and Management, vol. 1, no. 1, pp. 13-18, 2017.
[Google Scholar] [Publisher Link]
[28] Yair Caro, Adriana Hansberg, and Michael A. Henning, โ€œFair Domination in Graphs,โ€ Discrete Mathematics, vol. 312, no. 19, pp. 2905- 2914, 2012.
[CrossRef] [Google Scholar] [Publisher Link]
[29] Enrico L. Enriquez, โ€œSuper Fair Dominating Set in Graphs,โ€ Journal of Global Research in Mathematical Archives, vol. 6, no. 2, pp. 8- 14, 2019.
[Google Scholar] [Publisher Link]
[30] Debie Honey P. Galleros, and Enrico L. Enriquez, โ€œFair Restrained Dominating Set in the Cartesian Product and Lexicographic Product of Graphs,โ€ International Journal of Mathematics Trends and Technology, vol. 67, no. 7, pp. 87-93, 2021.
[CrossRef] [Google Scholar] [Publisher Link]
[31] Melodina D. Garol et al., โ€œDisjoint Fair Domination in the Join and Corona of Two Graphs,โ€ International Journal of Mathematics Trends and Technology, vol. 68, no. 2, pp. 124-132, 2022.
[CrossRef] [Google Scholar] [Publisher Link]
[32] Enrico L. Enriquez, โ€œInverse Fair Domination in the Join and Corona of Graphs,โ€ Discrete Mathematics, Algorithms and Application, vol. 16, no. 1, 2024.
[CrossRef] [Google Scholar] [Publisher Link]
[33] Gary Chartrand, and Ping Zhang, A First Course in Graph Theory, Dover Publication, pp. 1-464, 2012.
[Google Scholar] [Publisher Link

Citation :

Jan Niรฑo C. Serrano, Enrico L. Enriquez, "Fair Doubly Connected Domination in the Corona and the Cartesian Product of Two Graphs," International Journal of Mathematics Trends and Technology (IJMTT), vol. 69, no. 12, pp. 36-41, 2023. Crossref, https://doi.org/10.14445/22315373/IJMTT-V69I12P505

  • PDF
  • Abstract
  • Keywords
  • References
  • Citation
Abstract Keywords References Citation
  • Home
  • Authors Guidelines
  • Paper Submission
  • APC
  • Archives
  • Downloads
  • Open Access
  • Publication Ethics
  • Copyrights Infringement
  • Journals
  • FAQ
  • Contact Us

Follow Us

Copyright ยฉ 2025 Seventh Sense Research Groupยฎ . All Rights Reserved