This research introduces minimum equitable dominating Harary energy of graphs and calculates its bounds, suggesting future directions for study.
The purpose of this paper is to introduce the concept of minimum equitable dominating Harary energy HEed(G) of a graph. We also compute the minimum equitable dominating Harary energy HEed(G) of some families of graphs. We establish bounds for minimum equitable dominating Harary energy. Open problems are also given for further research.
No takes yet. Share an insight, caveat, or question.
Cangül et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: