The bandwidth of the complement of A K-TREE期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

按检索

The bandwidth of the complement of A K-TREE

Authors:	Yuan Jinjiang Lin Yixun

Institution:	(1) Department of Mathematics, Zhengzhou University, 450052 Zhengzhou

Abstract:	The paper proves that if G is a k-tree, then the bandwidth B $(\overline G )$ of the complement $(\overline G )$ of G is given by $B(\overline {G)} = {\text{ \{ }}_{n{\text{ - }}k{\text{ - 2, otherwise}}{\text{.}}}^{n{\text{ - }}k{\text{ - 1, when }}G{\text{ = }}K_k {\text{ + }}\overline {K_{n - k} } ,}$ Supported by National Natural Science Foundation of China(19771075).

Keywords:	Bandwidth k-tree complement
本文献已被 CNKI 维普 SpringerLink 等数据库收录！