摘要
对于一个n项非增的非负整数序列π=(d_1,…,d_n),若其是某个n阶简单图G的度序列,则称π是可图序列,并称G是π的一个实现.给定一个图H,如果π的某个实现包含H作为子图,则称π是蕴含H可图的.给出了当2≤n≤5,t≥2时r_(pot)(P_n,K_t)的确切值,从而完整确定了r_(pot)(P_n,K_t)值.
A non-increasing sequence π =（d1,…,dn）of nonnegative integers is a graph sequence if it is realizable by a simple graph G on n vertices. In this case,G is referred to as a realization of π. Given a graph H,if πhas a realization containing H as a subgraph,a graphic sequence π is potentially H-graphic. When 2≤n≤5,t≥2,the exact value for r（pot）（Pn,Kt）will be determined completely.
作者
杜晋智
尹建华
李莎莎
Du jinzhi;Yin Jianhua;Li Shasha(College of Information Science and Technology,Hainan University,Haikou 570228,China)
出处
《海南大学学报（自然科学版）》
CAS
2018年第3期212-215,共4页
Natural Science Journal of Hainan University
基金
海南省自然科学基金(2016CXTD004)
