A New property Of binary undirected de bruijn graphs

Xu Junming; Lu Changhong; Zhang Kemin

doi:10.1007/BF02731956

A New property Of binary undirected de bruijn graphs

Xu Junming^*
, Lu Changhong
, Zhang Kemin

^*此作品的通讯作者

University of Science and Technology of China
Nanjing University

科研成果: 期刊稿件 › 文章 › 同行评审

摘要

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.

源语言	英语
页（从-至）	39-42
页数	4
期刊	Chinese Annals of Mathematics. Series B
卷	21
期	1
DOI	https://doi.org/10.1007/BF02731956
出版状态	已出版 - 1月 2000
已对外发布	是

访问文件

10.1007/BF02731956

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{5f59307c2d134c2f81295cca1629a633,

title = "A New property Of binary undirected de bruijn graphs",

abstract = "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.",

keywords = "1991 MR Subject Classification: 05C40, 68M10, 68R10, Dominating number, Length of path, O157.5, O157.9, Wide-diameter, de Bruijn graph",

author = "Xu Junming and Lu Changhong and Zhang Kemin",

year = "2000",

month = jan,

doi = "10.1007/BF02731956",

language = "英语",

volume = "21",

pages = "39--42",

journal = "Chinese Annals of Mathematics. Series B",

issn = "0252-9599",

publisher = "Springer Verlag",

number = "1",

}

TY - JOUR

T1 - A New property Of binary undirected de bruijn graphs

AU - Junming, Xu

AU - Changhong, Lu

AU - Kemin, Zhang

PY - 2000/1

Y1 - 2000/1

N2 - 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.

AB - 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.

KW - 1991 MR Subject Classification: 05C40, 68M10, 68R10

KW - Dominating number

KW - Length of path

KW - O157.5

KW - O157.9

KW - Wide-diameter

KW - de Bruijn graph

UR - https://www.scopus.com/pages/publications/51649160143

U2 - 10.1007/BF02731956

DO - 10.1007/BF02731956

M3 - 文章

AN - SCOPUS:51649160143

SN - 0252-9599

VL - 21

SP - 39

EP - 42

JO - Chinese Annals of Mathematics. Series B

JF - Chinese Annals of Mathematics. Series B

IS - 1

ER -

A New property Of binary undirected de bruijn graphs

摘要

访问文件

其它文件与链接

指纹

引用此