New Results on the Minimum Edge Dominating Energy of a Graph
Journal of Mathematical Extension(2022)
Abstract
Let G be a graph with n vertices and m edges. The minimum edge dominating energy is defined as the sum of the absolute values of eigenvalues of the minimum edge dominating matrix of the graph G. In this paper, some lower and upper bounds for the minimum edge dominating energy of graph G are established.
MoreTranslated text
Key words
Minimum edge dominating energy, Eigenvalue, Adjacency matrix, Line graph
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined