The Minimum Edge Covering Energy of a Graph
From MaRDI portal
Publication:5035260
DOI10.46793/KgJMat2106.969SzbMath1499.05394OpenAlexW4200451386MaRDI QIDQ5035260
Akram Banihashemi Dehkordi, Saeed Mohammadian Semnani, Samira Sabeti
Publication date: 21 February 2022
Published in: Kragujevac Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: http://elib.mi.sanu.ac.rs/files/journals/kjm/68/10_eng.html
Graph polynomials (05C31) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Edge domination in some path and cycle related graphs
- The matching energy of a graph
- The energy of graphs and matrices
- Lower bounds for the energy of graphs
- Bounds for the Energy of Graphs
- MINIMUM DOMINATING DISTANCE ENERGY OF A GRAPH
- LAPLACIAN MINIMUM DOMINATING ENERGY OF A GRAPH
- Graphs with extremal incidence energy
- Graphs and matrices
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The Minimum Edge Covering Energy of a Graph