共 50 条
On potentially K 5-H-graphic sequences
被引:9
|作者:
Hu, Lili
[1
]
Lai, Chunhui
[1
]
Wang, Ping
[2
]
机构:
[1] Zhangzhou Teachers Coll, Dept Math, Zhangzhou 363000, Peoples R China
[2] St Francis Xavier Univ, Dept Math Stats & Comp Sci, Antigonish, NS B2G 2W5, Canada
基金:
加拿大自然科学与工程研究理事会;
中国国家自然科学基金;
关键词:
graph;
degree sequence;
potentially K-5 - H-graphic sequence;
EXTREMAL PROBLEM;
GRAPHIC SEQUENCE;
D O I:
10.1007/s10587-009-0012-8
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
Let K (m) -H be the graph obtained from 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 (5)-P (4) and K (5)-Y (4)-graphic sequences where Y (4) is a tree on 5 vertices and 3 leaves.
引用
收藏
页码:173 / 182
页数:10
相关论文