Broadcast networks can be expressed by a simple connected undirected graph.
将广播网络用简单连通的无向图表示。
This paper presents all the connected simple bigraphs whose energy does not exceed 4, and an inequality about the energy of a graph and the number of the edges of the graph.
本文给出所有能级不超过 4的连通偶图 ，并给出关于图的能级与其边的个数的一个不等式 。
应用推荐