|
|||||
|
|
| THE ASCENDING SUBGRAPH DECOMPOSITION OF K_n-H_(2n-1) | |
| 引用本文： | MA Kejie(Institute of Operations Research in Qufu Normal University,Qufu 273165,China)ZHANG Yuzhong(Institute of Applied Mathematics,Academia Sinica,Beijing 100080,China). THE ASCENDING SUBGRAPH DECOMPOSITION OF K_n-H_(2n-1)[J]. 系统科学与复杂性, 1997, 0(4) |
| 作者姓名： | MA Kejie(Institute of Operations Research in Qufu Normal University Qufu 273165 China)ZHANG Yuzhong(Institute of Applied Mathematics Academia Sinica Beijing 100080 China) |
| 作者单位： | MA Kejie(Institute of Operations Research in Qufu Normal University，Qufu 273165，China)ZHANG Yuzhong(Institute of Applied Mathematics，Academia Sinica，Beijing 100080，China) |
| 摘 要： | 1.IntroductiollAlavi,Y.etal.presentedaconceptofsubgraphdecompositionin[1],whichiscalledascendingsubgraphdecomposition(abbreviatedASD).GivenagraphGwithqedges,C: ,5q5C: ,GissaidtohaveanASD,ifthereisnsuchthatGcanbedecomposedintonsubgraphsGIjGi,''3G.withouti… |
THE ASCENDING SUBGRAPH DECOMPOSITION OF K_n-H_(2n-1) |
|
| MA Kejie. THE ASCENDING SUBGRAPH DECOMPOSITION OF K_n-H_(2n-1)[J]. Journal of Systems Science and Complexity, 1997, 0(4) | |
| Authors: | MA Kejie |
| Abstract: | A conjecture concerning a new kind of subgraph decomposition, the ascendingsubgraph decomposition, was proposed by Alavi Y. et al., as follows: Every graph ofpositive size has an ascending subgraph decomposition. In this paper it is proved thatG = Kn- H2n-1 has an ascending subgraph decomposition, where H2n-1 is any graphwith at most n venices and at most 2n - 1 edges (n > 6). |
| Keywords: | Conjecture ascending subgraph decomposition. |
| 本文献已被 CNKI 等数据库收录！ | |