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

zbMATH Open1332.05093MaRDI QIDQ486879FDOQ486879

Authors: Paul August Winter 

Publication date: 16 January 2015

Published in: Advances in Mathematics. Scientific Journal (Search for Journal in Brave)

Recommendations

• The minimum edge covering energy of a graph
• Laplacian minimum covering energy of a graph
• Minimum covering Seidel energy of a graph
• Minimum covering Harary energy of a graph
• Laplacian minimum dominating energy of a graph

zbMATH Keywords

vertex coveringgraph energy

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

This page was built for publication: 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q486879)