Saturation Numbers for Nearly Complete Graphs
Saturation Numbers for Nearly Complete Graphs
复制标题
DOI：
10.1007/s00373-011-1128-9
复制
发表时间：
2013-05
影响因子：
0.7
通讯作者：
R. Faudree;R. Gould
中科院分区：
文献类型：
--
作者：
R. Faudree;R. Gould
图以及相关极值图的饱和数上限由（Kászonyi 和 Tuza in J. Graph Theory, 10:203–210, 1986）给出。将说明他们的论文中暗示的对该结果的微小改进。使用这个结果，将证明几乎完整的图 Kt−E(L) 的一系列精确饱和数和相关的极值图，其中 Li 是最多 4 阶的图。
An upper bound on the saturation number for graphs as well as associated extremal graphs was given by (Kászonyi and Tuza in J. Graph Theory, 10:203–210, 1986). A minor improvement of that result, which was implied in their paper, will be stated. Using this result, a series of exact saturation numbers and associated extremal graphs will be proved for the nearly complete graphsKt−E(L), whereLis a graph of order at most 4.