徐梅芳,马克杰.关于图Kn-H2n+i(i=1,2)的升分解[J].数学研究及应用,2002,22(1):71~75 |
关于图Kn-H2n+i(i=1,2)的升分解 |
On the Ascending Subgraph Decomposition of Kn-H2n+i(i=1,2) |
投稿时间:1998-06-10 |
DOI:10.3770/j.issn:1000-341X.2002.01.010 |
中文关键词: 升分解 对集 |
英文关键词:ascending subgraph decomposition conjecture. |
基金项目:山东省自然科学基金资助项目(Y97A10015) |
|
摘要点击次数: 2230 |
全文下载次数: 886 |
中文摘要: |
Yousef.Alavi等人在文献[1]中定义了一种新分解(Ascending Subgraph Decomposi- tion),即“升分解”,并且猜想:任意有正整数条边的图都可以升分解.本文证明了下面两个结 论: 1.Kn-H2n+1可以升分解,其中H2n+1为含有2n+1条边的Kn的子图; 2.Kn-H2n+2可以升分解,其中H2n+2为含有2n+ |
英文摘要: |
A conjecture concerning the ascending subgraph decomposition posed by Y. Alavi et. al in [1] is as follows: Every graph of positive size has an ascending subgraph decomposition. This note prove the following two results. 1. Kn-H2n+1(n≥ 8) can be ascending subgraph decomposition into K1,1 ,K1,2,...,K1,n-5,Gn-4; 2. Kn-H2n+1 (n≥ 10) can be ascending subgraph decomposition into K1,1,K1,2,..., K1,n-5,Gn-4. |
查看全文 查看/发表评论 下载PDF阅读器 |
|
|
|