Saturation Numbers for Nearly Complete Graphs

被引：11

作者：

Faudree, Ralph J. ^{[1
]}

Gould, Ronald J. ^{[2
]}

机构：

[1] Univ Memphis, Dept Math Sci, Memphis, TN 38152 USA

[2] Emory Univ, Dept Math & Comp Sci, Atlanta, GA 30322 USA

来源：

GRAPHS AND COMBINATORICS | 2013年 / 29卷 / 03期

关键词：

Saturation numbers; Extremal graphs; Complete graphs;

D O I：

10.1007/s00373-011-1128-9

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

An upper bound on the saturation number for graphs as well as associated extremal graphs was given by (Kaszonyi 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 graphs K (t) - E(L), where L is a graph of order at most 4.

引用

页码：429 / 448

页数：20