On the Ascending Subgraph Decomposition of Kn-H2n+i(i=1,2)
Received:June 10, 1998  
Key Words: ascending subgraph decomposition   conjecture.  
Fund Project:
Author NameAffiliation
XU Mei-fang Teaching and Research Section of Computer
Jining Medicine College
Shandong
China 
MA Ke-jie Inst. of the Operationing Research
Qufu Normal University
China 
Hits: 2247
Download times: 898
Abstract:
      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.
Citation:
DOI:10.3770/j.issn:1000-341X.2002.01.010
View Full Text  View/Add Comment