共 50 条
On potentially K6-3K2-graphic sequences
被引:0
|作者:
Chen, Gang
[1
]
机构:
[1] Ningxia Univ, Sch Math & Comp Sci, Dept Informat, Yinchuan 750021, Ningxia, Peoples R China
来源:
关键词:
graph;
degree sequence;
potentially K-6-3K(2)-graphic sequences;
EXTREMAL PROBLEM;
LEHEL CONJECTURE;
GRAPHIC SEQUENCE;
JACOBSON;
ERDOS;
KR+1;
D O I:
暂无
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
Let K-m - H be the graph obtained from the complete graph on m vertices K-m by removing the edges set E(H) of H, where H is a subgraph of K-m. In this paper, we characterize the potentially K-6 - 3K(2)-graphic sequences, where pK(2) is the matching consisted of p edges.
引用
收藏
页码:3 / 21
页数:19
相关论文