A note on the minimum edge dominating energy of graphs

A note on the minimum edge dominating energy of graphs

Let G be a graph with n vertices and m edges. The edges energy is defined as the sum of the absolute values of eigenvalues of the adjacency matrix of line graph of G . In this paper, the minimum edge dominating energy of the graph G is introduced and the minimum edge dominating energy of some graphs...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of applied mathematics & computing 2020-06, Vol.63 (1-2), p.295-310
Hauptverfasser: Akhbari, Mohammad Hadi, Choong, Kok Keong, Movahedi, Fateme
Format: Artikel
Sprache:eng
Schlagworte:
Apexes
Applied mathematics
Computational Mathematics and Numerical Analysis
Eigenvalues
Graph theory
Graphs
Mathematical and Computational Engineering
Mathematics
Mathematics and Statistics
Mathematics of Computing
Original Research
Theory of Computation
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Let G be a graph with n vertices and m edges. The edges energy is defined as the sum of the absolute values of eigenvalues of the adjacency matrix of line graph of G . In this paper, the minimum edge dominating energy of the graph G is introduced and the minimum edge dominating energy of some graphs is computed. We also investigate the bounds of the minimum edge dominating energy of graphs.
ISSN:1598-5865
1865-2085
DOI:10.1007/s12190-020-01318-7