应用数学2000，Vol.13Issue(3)：73-78,6.
关于带宽极值问题的两个结果
Two Results on Extremal Bandwidth Problem
郝建修1
作者信息
- 1. 郑州大学数学系,郑州,450052;安阳师专数学系,安阳,455002
- 折叠
摘要
Abstract
The problem studied in this paper is to det ermine e*(p,B), the minimum size of a connect ed graph G with given vertex number p and bandwidth B. This paper presents exact results on B=p+3/2and B=p/2+2.关键词
图的标号/带宽/极图Key words
Graph labeling/Bandwidth/Extremal graph分类
数理科学引用本文复制引用
郝建修..关于带宽极值问题的两个结果[J].应用数学,2000,13(3):73-78,6.
