带宽等于最小度的图的最小边数  

Minimal Number of Graphic Edges of a Given Bandwidth Equaling Minimal Degree

作　　者：周贤伟[1] 张拥军[1] 朱健梅[1] 杜文[1] 

机构地区：[1]西南交通大学运输系,成都610031

出　　处：《应用数学与计算数学学报》1998年第1期44-50,共7页Communication on Applied Mathematics and Computation

摘　　要：本文对带宽等于最小度的图的边数极值问题进行了研究,主要结果如下:对任意给定的正整数n及r(r<n),min{|E(G)|||V(G)|=n,B(G)=δ(G)=r}=[1/2nr]。In this paper, we deal with extremal graph that number of the edges of graph of a given bandwidth is equal to minimal degree. The main result is recounted as following: for arbitrary given positive integer n and r(r<n).

关 键 词：图 带宽 边数 最小度 最小边数 

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