检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:XU JUNMING LU CHANGHONG ZHANG KEMIN
机构地区:[1]Department of Mathematics,University of Science and Technology of China,Hefei 230026,China [2]Department of Mathematics,Naniing University,Naniing 210093,China
出 处:《Chinese Annals of Mathematics,Series B》2000年第1期39-42,共4页数学年刊(B辑英文版)
基 金:National Natural Science Foundation of China(No.19971086,19871040);Jiangsu Provincial Natural Science Foundation of China
摘 要:The authors obtain a new property of the n-dimensional binary undirected de Bruijn graph UB(n)for n≥4,namely,there is a vertex x such that for any other vertex y there exist at least two internally disjoint paths of length at most n-1 between x and y in UB(n).The result means that the(n-1,2)-dominating number of UB(n)is equal to one if n≥4.
关 键 词:de Bruijn graph WIDE-DIAMETER Length of path Dominating number
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.248