Some Bounds for the Minimum Edge Dominating Energy of Graphs

Authors

  • Fateme Movahedi Department of Mathematics, Faculty of Sciences, Golestan University, IRAN
  • Mohamad Hadi Akhbari Department of Mathematics, Estahban Branch, Islamic Azad University, IRAN
  • Roslan Hasni Special Interest Group of Modeling and Data Analytics (SIGMDA), Faculty of Computer Science and Mathematics, Universiti Malaysia Terengganu, MALAYSIA
  • Nabeel Ezulddin Arif Department of Mathematics, College of Computer Science and Mathematics, Tikrit University, IRAQ
  • Sumarni Abu Bakar Faculty of Computer Science and Mathematics, UiTM Shah Alam, MALAYSIA

DOI:

https://doi.org/10.17576/jqma.2102.2025.14

Keywords:

eigenvalue, minimum edge dominating energy, line graph

Abstract

The minimum edge dominating energy, denoted by EEF(G), of a graph G is the sum of the absolute values of eigenvalues of the minimum edge dominating matrix with respect to a minimum edge dominating set F of the graph G. In this study, some bounds for the minimum edge dominating energy are obtained.

Downloads

Published

27-09-2026

How to Cite

Movahedi, F., Akhbari, M. H., Hasni, R., Arif, N. E., & Bakar, S. A. (2026). Some Bounds for the Minimum Edge Dominating Energy of Graphs. Journal of Quality Measurement and Analysis, 21(2), 201–216. https://doi.org/10.17576/jqma.2102.2025.14

Issue

Vol. 21 No. 2 (2025)

Section

Articles

License

Copyright (c) 2025 Journal of Quality Measurement and Analysis

Creative Commons License

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

This work is licensed under a Creative Commons Attribution 4.0 International License (CC BY 4.0).

This license permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Crossref
Scopus
Google Scholar
Europe PMC

Most read articles by the same author(s)