分别给出了直径为2的图的λ3最优性和不含三角的图是超级λk的一个充分条件,讨论了不含三角的图的λk最优性和λk超级性的关系,这些结果在网络可靠性分析中有一定应用.
This paper shows a sufficient condition for λk-optimality in graphs with diameter 2, a sufficient condition for triangle-free graphs to be super-λk, and the relations between λk-optimality and super-λk of triangle-free graphs. These results have some applications to analysis of the network reliability.