The minimum edge covering energy of a graph
DOI10.46793/KGJMAT2106.969SzbMATH Open1499.05394OpenAlexW4200451386MaRDI QIDQ5035260FDOQ5035260
Authors: Samira Sabeti, Akram Banihashemi Dehkordi, Saeed Mohammadian Semnani
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
- Resolvent energy of graphs
- Edge domination in some path and cycle related graphs
- Lower bounds for the energy of graphs
- Graphs with extremal incidence energy
- Some new results on energy of graphs
- Bounds for the energy of graphs
- Minimum dominating distance energy of a graph
Cited In (9)
- Minimum covering randic energy of a graph
- Laplacian minimum covering energy of a graph
- The minimum hub energy of a graph
- A characterization of graphs with 3-path coverings and the evaluation of the minimum 3-covering energy of complete graphs and star graph with \(m\) rays of length 2
- The relation between the minimum edge dominating energy and the other energies
- Covering energy of some classes of posets
- Minimum covering Seidel energy of a graph
- On minimum covering partition energy of a graph
- Minimum covering Harary energy of a graph
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)