On an extremal problem related to a theorem of Whitney

被引：0
|
作者：
Singh, Mohit
Tripathi, Amitabha
机构：
[1] Carnegie Mellon Univ, GSIA, Pittsburgh, PA 15213 USA
[2] Indian Inst Technol, Dept Math, New Delhi 110016, India
来源：
DISCRETE APPLIED MATHEMATICS | 2007年 / 155卷 / 04期
关键词：
vertex connectivity; edge connectivity;
D O I：
10.1016/j.dam.2006.09.007
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A well known theorem of Whitney states that for any graph G, kappa(G) <= kappa '(G) <= delta(G). For any set of positive integers a, b, c, a <= b <= c, we determine the least order and the least size among all graphs with kappa = a, kappa ' = b and 6 = c. We also show that there exist graphs of all orders greater than or equal to the least order among those graphs with kappa = a, kappa ' = b and delta = c. (c) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码：579 / 583
页数：5
相关论文
共 50 条
12345