论文标题
图和兰迪克指数的能量
Energy of a graph and Randic index
论文作者
论文摘要
我们证明，对于任何图形$ g $，其图形能量至少是Randic索引的两倍。我们表明，仅当$ g $是完整的两部分图的结合时，平等才能保持。
We prove that, for any graph $G$, its graph energy is at least twice the Randic index. We show that equality holds if and only if $G$ is the union of complete bipartite graphs.
