A note on the minimum edge dominating energy of graphs
| Autor: | Fateme Movahedi, M. H. Akhbari, Kok Keong Choong |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Applied Mathematics
010103 numerical & computational mathematics 0102 computer and information sciences Edge (geometry) 01 natural sciences Graph law.invention Combinatorics Computational Mathematics 010201 computation theory & mathematics law Theory of computation Line graph Adjacency matrix 0101 mathematics Energy (signal processing) Eigenvalues and eigenvectors MathematicsofComputing_DISCRETEMATHEMATICS Mathematics |
| Zdroj: | Journal of Applied Mathematics and Computing. 63:295-310 |
| ISSN: | 1865-2085 1598-5865 |
| DOI: | 10.1007/s12190-020-01318-7 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink