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

来源：

CZECHOSLOVAK MATHEMATICAL JOURNAL | 2009年 / 59卷 / 01期

基金：

中国国家自然科学基金; 加拿大自然科学与工程研究理事会;

关键词：

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

共 26 条

[1] Bondy J. A., 1976, Graduate Texts in Mathematics, V290
[2] Erdos P., 1991, Graphs realizing the same degree sequence and their respective clique numbers, graph theory, combinatorics and applications, Vi, P439
[3] Eschen E., 2004, Australas. J. Combin, V29, P59
[4] FERRARA M, ARS COMB IN PRESS
[5] FERRARA M, POTENTIALLY KT UNPUB
[6] Gould R.J., 1999, Combinatorics, Graph Theory, and Algorithms, V1, P451
[7] Graphic sequences of trees and a problem of Frobenius
Gupta, Gautam
Joshi, Puneet
Tripathi, Amitabha
[J]. CZECHOSLOVAK MATHEMATICAL JOURNAL, 2007, 57 (01) : 49 - 52
[8] Hu LL, 2011, ARS COMBINATORIA, V99, P175
[9] HU LL, POTENTIALLY K5 UNPUB
[10] Kleitman D. J., 1973, Discrete Mathematics, V6, P79, DOI 10.1016/0012-365X(73)90037-X

← 1 2 3 →