具有3-覆盖的图的一个刻划及具有m条尺子为2的射线的星图的3-覆盖能量的估计
A characterization of graphs with 3-coverings and the evaluation of the 3-covering energy of star graphs with m rays of length 2
摘要：
图G的最小顶点集Q，使得3个顶点上的每条路至少有一个顶点在Q中，是G的最小3-覆盖。通过在G的顶点上附加权为1的环，我们可以找到与G相关的特征值，从而找到G的最小3-覆盖能量。本文用非Q-覆盖边刻画了具有3-覆盖的图，并确定了具有m条长度为2的射线的星图的最小3-覆盖能量。
英文摘要：
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 vertices of G we can find the eigenvalues associated with G, and hence the minimum 3-covering energy of G. In this paper we characterize graphs with 3-coverings in terms of non-Q-covered edges, and we determine the minimum 3-covering energy of a star graph with m rays each of length 2.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
