Back to Search
Start Over
Bounds on the minimum edge dominating energy of induced subgraphs of a graph.
- Source :
- Discrete Mathematics, Algorithms & Applications; Dec2021, Vol. 13 Issue 6, p1-12, 12p
- Publication Year :
- 2021
-
Abstract
- Let G be a graph with n vertices and m edges. The minimum edge dominating energy is equal to the sum of the absolute values of eigenvalues of the minimum edge dominating matrix of graph G. In this paper, we establish some bounds for the minimum edge dominating energy of subgraphs of a graph. [ABSTRACT FROM AUTHOR]
- Subjects :
- SUBGRAPHS
ABSOLUTE value
EDGES (Geometry)
MAXIMA & minima
EIGENVALUES
Subjects
Details
- Language :
- English
- ISSN :
- 17938309
- Volume :
- 13
- Issue :
- 6
- Database :
- Complementary Index
- Journal :
- Discrete Mathematics, Algorithms & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 154042139
- Full Text :
- https://doi.org/10.1142/S1793830921500804