In 1968, Ore determined the maximum size of $k$-connected graphs with given order and diameter. In this note, we give a new short proof.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。