Friendly Domination in Graph

Authors

  • Isagani, Jr Cabahug Department of Mathematics, College of Arts and Sciences, Central Mindanao University, 8714 Bukidnon, Philippines https://orcid.org/0000-0003-2954-8304
  • Rolito Eballe Department of Mathematics, College of Arts and Sciences, Central Mindanao University, 8714 Bukidnon, Philippines
  • Reynard Fernandez Department of Mathematics, College of Arts and Sciences, Central Mindanao University, 8714 Bukidnon, Philippines

DOI:

https://doi.org/10.29020/nybg.ejpam.v18i4.6326

Keywords:

Friendly set, Friendly Domination, Domination

Abstract

Friendly domination combines two ideas in graph theory: domination, which captures influence, and friendly sets, which balance that influence. We study the friendly dominating set and the friendly domination number, the smallest size of a set that is both dominating and friendly. First, we prove that for every graph the usual domination number is never larger than its friendly domination number, and we identify all graphs whose friendly domination number equals one or two. We then show that the gap between these two parameters can be made arbitrarily large. Exact formulas are derived for paths and cycles. Sharp Nordhaus–Gaddum bounds are obtained for the sum and product of the friendly domination number of a graph and its complement. Finally, we give complete structural characterizations of friendly dominating sets in the join and corona of two graphs. 

Author Biography

  • Isagani, Jr Cabahug, Department of Mathematics, College of Arts and Sciences, Central Mindanao University, 8714 Bukidnon, Philippines

    Department of Mathematics, (Full) Professor

Downloads

Published

2025-11-05

Issue

Vol. 18 No. 4: (October 2025)

Section

Discrete Mathematics

License

Copyright (c) 2025 Isagani, Jr Cabahug, Rolito Eballe, Reynard Fernandez

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.

By agreeing to this statement, you acknowledge that:

  • You retain full copyright over your work.
  • The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
  • This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.

How to Cite

Friendly Domination in Graph. (2025). European Journal of Pure and Applied Mathematics, 18(4), 6326. https://doi.org/10.29020/nybg.ejpam.v18i4.6326