MINIMAL REGULAR GRAPH CONTAINING A GIVEN GRAPH

被引：1
|
作者：
SHASTRI, A [1 ]
机构：
[1] MIT,DEPT MATH,CAMBRIDGE,MA 02139
来源：
APPLIED MATHEMATICS LETTERS | 1992年 / 5卷 / 01期
关键词：
D O I：
10.1016/0893-9659(92)90124-R
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
It is shown that every graph on n vertices can be realized as an induced subgraph of a regular graph on at most 2n - 2 vertices and this is the best realization possible. The proof uses an extension of a theorem of Erdos and Kelley, and some related results are also deduced.
引用
收藏
页码：3 / 5
页数：3
相关论文
共 50 条
12345