THE BANDWIDTH OF THE COMPLEMENT OF A K-TREE  

作　　者：YUAN JINJIANG AND LIN YIXUN 

出　　处：《Applied Mathematics(A Journal of Chinese Universities)》1998年第4期451-454,共4页高校应用数学学报（英文版）（B辑）

摘　　要：Abstract The paper proves that if G is a k tree, then the bandwidth B(G) of the complement G of G is given by B(G)=n-k-1, when GK k+K n-k , n-k-2, otherwise.Abstract The paper proves that if G is a k tree, then the bandwidth B(G) of the complement G of G is given by B(G)=n-k-1, when GK k+K n-k , n-k-2, otherwise.

关 键 词：BANDWIDTH K-TREE COMPLEMENT 

分 类 号：O157.5[理学—数学]