| 蕴含pK_2-可图序列(英文) |
| |
| 引用本文： | 尹建华.蕴含pK_2-可图序列(英文)[J].黑龙江大学自然科学学报,2009,26(1). |
| |
| 作者姓名： | 尹建华 |
| |
| 作者单位： | 海南师范大学计算机科学与教育技术系,海口,571158;海南大学数学系,海口,570228 |
| |
| 摘 要： | 设p≥1,pK2是p个K2的不相交的并,π=(d1,d2,…,dn)是一个可图序列且n≥2p.如果π有一个实现包含pK2作为子图(即π有一个实现包含一个p条边的匹配),则π称为是蕴含pK2-可图的.给出了蕴含pK2-可图序列π的一个刻划.
|
| 关 键 词： | 图 匹配 度序列 |
Potentially pK_2-graphic Sequences |
| |
| YIN Jian-hua.Potentially pK_2-graphic Sequences[J].Journal of Natural Science of Heilongjiang University,2009,26(1). |
| |
| Authors: | YIN Jian-hua |
| |
| Institution: | 1.Department of Computer Science and Education Technology;Hainan Normal University;Haikou 571158;China;2.Department of Mathematics;Hainan University;Haikou 570228;China |
| |
| Abstract: | Let p≥1,pK2 be the disjoint union of p copies of K2 and π=(d1,d2,…,dn)be a graphic sequence with n≥2p.If π has a realization containing pK2 as a subgraph(i.e.π has a realization containing a matching of p edges),then π is said to be potentially pK2-graphic.A characterization for π to be potentially pK2-graphic is given. |
| |
| Keywords: | graph matching degree sequence |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
