On Potentially K2,2,1,1-graph Graphic Sequences

被引：0
|
作者：
Liu, Mingjing [1 ]
Lai, Chunhui [1 ]
机构：
[1] Zhangzhou Teachers Coll, Dept Math, Zhangzhou 363000, Fujian, Peoples R China
来源：
UTILITAS MATHEMATICA | 2011年 / 85卷
关键词：
graph; degree sequence; potentially K-2; K-2; K-1; K-1-graphic sequences; complete 4-partite graph; SMALLEST DEGREE SUM; EXTREMAL PROBLEM; LEHEL CONJECTURE; JACOBSON; ERDOS; TRUE;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
For given a graph H, a graphic sequence pi = (d(1), d(2), ..., d(n)) is said to be potentially H-graphic if there exists a realization of pi containing H as a subgraph. In this paper, we characterize the potentially K-2,K-2,K-1,K-1-graphic sequences where K-r,K-s,K-p,K-t is an r x s x p x t complete 4-partite graph. Up to now, characterization of potentially complete 4-partite graph with k(k <= 6) vertices has solved.
引用
收藏
页码：45 / 63
页数：19
相关论文
共 42 条
12345