| 一些特殊树的对偶带宽 |
| |
| 引用本文： | 要卫丽,鲁晓旭,周菊. 一些特殊树的对偶带宽[J]. 郑州大学学报(理学版), 2003, 35(3): 16-19 |
| |
| 作者姓名： | 要卫丽 鲁晓旭 周菊 |
| |
| 作者单位： | 郑州大学数学系,郑州,450052 |
| |
| 摘 要： | 图G的对偶带宽是指图G中相邻两点最小标号差的最大值。确定了一些特殊树的对偶带宽，主要结果如下：(1)如果树T有n个顶点，并且其最大度△(T)不小于[n/2]，那么树T的对偶带宽等于n一△(T)的充要条件为T是双层星且其内星的中心为最大度顶点；(2)完全二叉树T2,k的对偶带宽等于2^k-1；(3)等高单毛虫树Pm,n的对偶带宽为[mn/2]。
|
| 关 键 词： | 图论 对偶带宽 最小标号差 最大度顶点 树 |
Dual Bandwidth of Some Special Trees |
| |
| Yao Weili,Lu Xiaoxu,Zhou Ju. Dual Bandwidth of Some Special Trees[J]. Journal of Zhengzhou University(Natrual Science Edition), 2003, 35(3): 16-19 |
| |
| Authors: | Yao Weili Lu Xiaoxu Zhou Ju |
| |
| Abstract: | The dual bandwidth of a graph G,denoted by (G),is the maximum value of the minimum labelling variance of any two adjacent vertices in G.The dual bandwidth is determined for some special trees.The main results are as follows:(1)For a tree T with n vertices and with Δ(T)≥「(n)/(2)*4,(T)＝n-Δ(T) if and only if T is two-layer star such that the center of inner star is of degree Δ(T).(2)The dual bandwidth of uniform binary tree T2,k is (T2,k)＝2k-1.(3)The dual bandwidth of caterpillar Pm,n is (Pm,n)＝*5(mn)/(2)」. |
| |
| Keywords: | labelling tree dual bandwidth |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
