蕴含K<sub>5</sub>-e图的度序列

黄琴

您当前的位置：

首页 >

文章列表页 >

蕴含K₅-e图的度序列

更新时间：2026-01-21

- 蕴含K₅-e图的度序列
- Journal of Xinjiang University (Natural Science Edition in Chinese and English) Issue 3, (2005)
- 作者机构：
  
  漳州师范学院数学系,福建,漳州,363000
- 作者简介：
- 基金信息：
- DOI：
  CLC： O157.5
- Published：2005
- 稿件说明：
移动端阅览
[1]黄琴.蕴含K_5-e图的度序列[J].新疆大学学报(自然科学版),2005(03):276-284.

黄琴. 蕴含K₅-e图的度序列[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2005, (3).
[1]黄琴.蕴含K_5-e图的度序列[J].新疆大学学报(自然科学版),2005(03):276-284. DOI：

黄琴. 蕴含K₅-e图的度序列[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2005, (3). DOI：

摘要

设σ(G

n)是具有下述性质的最小正偶数

每一项和至少为σ(G

n)的n项可图序列π都有一个实现包含G作为子图.本文给出σ(K5-e

7)=32

σ(K5-e

8)=36

以及当n≥9时

σ(K5-e

n)=2[5n2-6].

Abstract

A sequence π is potentially K -5-e graphical if it has a realization containing a K -5-e. Let σ(K -5-e

n) denote the smallest degree sum such that every graphical sequence π with σ(π)≥σ(K -5-e

n) is potentially K -5-e graphical. In this paper

we prove that σ(K -5-e

7)=32

σ(K -5-e

8)=36

and for n≥9

σ(K -5-e

n)=2[[SX(]5n-6[]2[SX)]].

关键词

Keywords

references

Erdo's P,Jacobson M S and Lehel J.Graphs realizing the same degree sequences and their respective clique numbers[M],in Graph Theory,Combinatorics Applications,Vol.l(Y.Alavietal.ed.)John Wiley Sons,Inc,New York,1991,439-449.

Li Jiong-Sheng and Song Zi-Xia An extemal problem on the potentially Pk-graphical sequences[J].Discrete Math,2000,212:223-231.

Li Jiong-Sheng and Song Zi-Xia.The smallest degree sum that yields potintially Pk-graphical sequences[J].J Graph Theory,1998,29:63-72.

Jiong-Sheng and Song Zi-Xia.On the potetially Pk-raphic sequences[J].Discrete Math,1999,195:255-262.

Li Jiong-Sheng,Song Zi-Xia,Lou Rong.The Erdos-Jacobson-Lehel conjecture on potentiallyPk-graphical sequences[J].Science in China,1998,41(5):510-520.

RMJR.J.Gould,Jacobson M S and Lehel.J Potentially,G-graphical degree sequences[C].in:Y.Alavi,D.R.Lick and A.Schwenk,eds,Combinatoncs,graph theory and algorithms,Vol2,New Issues Press,Kalamazoo,MI,1999,451-460.

Lai1Lai Chunhui.Potentially Ck-graphical degree sequences[J].J ZhangZhou Teachers College,1997,11(4):27-31.

Lai Chunhui.The smallest degree sum that yields potentially Ckgraphical sequences[J].Journal of Combinatorial Mathematics and Combinatorial Computing,2004,49:57-64.

Lai Chunhui.A note on potentially K4-egraphical sequences[J].Australasian J of Combinatorics,2001,24:123-127.

QinHuang Qin.Potentially Km-e-graphical degree sequences[J].J ZhangZhou Teachers College,2002,15(4):26-28.

Kleitman D J,Wang D L.Algorithm for constructing graphs and digraphs with given valences and factors[J].Discrete Math,1973,6(1):79-88.

ErdErdo∨s P,Gallai T.Graphs with given degree of vertices[J].Math Lapok,1960,(11):264-274.

Rao A R.The clique number of a graph with a given degree sequence[C],in Proc.Symposium on Graph Theory(A.R.Rao ed.).MacMillan and Co India Ltd,I Lecture Note Series,1979,4:251-267.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰

蕴含K5-e图的度序列

DOI：

摘要

Abstract

关键词

Keywords

references

蕴含K₅-e图的度序列