Independent Edge Domination Topology of Some Graph Families
DOI:
https://doi.org/10.29020/nybg.ejpam.v18i2.6046Keywords:
Complete graph, Friendship graph, Complete bipartite graph, Independent edge domination topologyAbstract
Let $G = (V(G),E(G))$ be a nonempty graph. An independent edge dominating set is an independent set of edges which is also an edge dominating set of $G$. The family of independent edge dominating sets of $G$ generates a unique topology. In this paper, we formally defined the new notion of topology generated by the family of independent edge dominating sets (IEDS) in a graph called the independent edge domination topology of $E(G)$, denoted as $\tau_{ID}^E (G)$. Moreover, we characterize the subbasic sets generated from the family of independent edge dominating sets and the independent edge domination topology of some graph families.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Jhon Neceir Ontulan, Cherry Mae Balingit
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.