A characterization for a graphic sequence to be potentially K-2,K-s-graphic

作者：Yin, Meng-Xiao^*; Yin, Jian-Hua; Wang, Ye; Zhong, Cheng

来源：Utilitas Mathematica, 2010, 82: 25-31.

• graph
• degree sequence
• potentially K-r,K-s-graphic sequence

A non-increasing sequence pi = (d(1), d(2),...,d(n)) of nonnegative integers is said to be potentially K-r,K-s-graphic if it is realizable by a graph on n vertices containing K-r,K-s as a subgraph, where K-r,K-s is the r x s complete bipartite graph. In this paper, we characterize the potentially K-2,K-s-graphic sequences. This characterization partially answers one problem due to Li and Yin (Adv. Math., 33(2004), 273-283).

• 出版日期2010-7
• 单位海南大学; 广西大学