关于图的连通度、宽直径、顶点数函数的讨论  

THE DISCUSSION OF THE FUNCTION ON CONNECTIVITY, WIDE-DIAMETER AND NUMBER OF NODES

作　　者：孙水玲[1] 

机构地区：[1]广东技术师范学院计算机科学系,广东省广州市510665

出　　处：《曲阜师范大学学报（自然科学版）》2003年第1期46-48,共3页Journal of Qufu Normal University(Natural Science)

摘　　要：FrankHsuD博士 (1994年 )中提出了w_距离 (w_distance)和w_直径 (w_diameter)的概念 ,介绍了“函数h(k ,d ,n)” ,其中的参变数包含连通度k ,最大直径d和顶点个数n .该文对这个函数进行了讨论 ,给出了部分结果 .The notions of w-distance and w-diameter on a graph were proposed by Frank Hsu D(1994) of Fordham University which generalize both concepts of connectivity and diameter and known results are surveyed and the open problems were offered for further investigation. The fifteenth problem of the 'open problems' is studied and the function h(k,d,n). The parameters of the function are connectivity k, diameter d, and vertices n respectively. The function is explored and a number of results are given.

关 键 词：连通度 宽直径 顶点数函数 w-距离 w-直径 简单图 图论 

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