A condition that yields potentially K14,s-graphic sequences

被引：0
作者：
Yin, Meng-Xiao [1 ,2 ]
Gao, Nan [1 ]
Zhong, Cheng [1 ,2 ]
Yang, Feng [1 ,2 ]
机构：
[1] Guangxi Univ, Sch Comp Elect & Informat, Nanning 530004, Peoples R China
[2] Guangxi Univ, Guangxi Key Lab Multimedia Commun & Network Techn, Nanning 530004, Peoples R China
来源：
UTILITAS MATHEMATICA | 2018年 / 108卷
基金：
中国国家自然科学基金;
关键词：
Graph; Degree sequence; Potentially K-14; K-s-graphic;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A graphic sequence pi (d(1), d(2), ..., d(n)) is said to be potentially K-14,K-s-graphic if there is a realization of pi containing K-14,K-s as a subgraph, where K-14,K-s is the 1 x 1 x 1 x 1 x s complete 5-partite graph. This paper poses a condition that yields potentially K-14,K-s-graphic sequences for s >= 1 and n >= 13s - 4, it generalizes the result of Yin[1].
引用
收藏
页码：159 / 167
页数：9
相关论文
共 11 条
12