一些图的对偶带宽

摘要

图G的对偶带宽是指图G中相邻两点最小标号差的最大值,记作B<'->(G).该文仅考虑母图H为路的情形.设图G的顶点数为n,图G在路P<,n>上的嵌入可以用一一映射f:V(G)→{1,2,...,n}来表示,f称为图G的一种标号.该文研究了双层星,完全2t分树,等毛虫树,路幂图,长度为2的路与长度为n的圈的乘积图,等高单毛虫树,以及Mobius梯子的对偶带宽.

目录

English Abstract

Chapter 1 Introduction

1.1 Introduction and problem formulation

1.2 Basic terminology

1.3 Survey of known results and main results in the thesis

Chapter 2 Main Results and Proofs

2.1 Dual bandwidth of special product graphs

2.2 Dual bandwidth of some special trees

2.3 Dual bandwidth of some 3-regular graphs

Reference

Acknowledgements