| 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. |
