The minimum edge covering energy of a graph
DOI10.46793/KGJMAT2106.969SzbMATH Open1499.05394OpenAlexW4200451386MaRDI QIDQ5035260FDOQ5035260
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
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph polynomials (05C31) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- The energy of graphs and matrices
- Incidence energy of a graph
- On incidence energy of graphs
- Graphs and matrices
- The matching energy of a graph
- LAPLACIAN MINIMUM DOMINATING ENERGY OF A GRAPH
- Title not available (Why is that?)
- Edge domination in some path and cycle related graphs
- Lower bounds for the energy of graphs
- Graphs with extremal incidence energy
- Title not available (Why is that?)
- Bounds for the Energy of Graphs
- MINIMUM DOMINATING DISTANCE ENERGY OF A GRAPH
Cited In (2)
This page was built for publication: The minimum edge covering energy of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5035260)