2 papers
math.CO2013
A characterization of graphs with 3-coverings and the evaluation of the 3-covering energy of star graphs with m rays of length 2
Paul August Winter
The smallest set Q of vertices of a graph G, such that every path on 3 vertices, has at least one vertex in Q, is a minimum 3-covering of G. By attaching loops of weight 1 to the v…
math.CO2013
The Mimimum 3-Covering Energy of Complete Graphs
Paul August Winter
In this paper we introduce a different kind of graph energy, the minimum 3-covering energy of a graph, and determine the minimum 3-covering energy of complete graphs.