Traversability of graph space with given degree sequence under edge rewiring

doi:10.1049/el.2010.3411

	Traversability of graph space with given degree sequence under edge rewiring
	Zhang, G.
	2010-03-04
发表期刊	ELECTRONICS LETTERS
ISSN	0013-5194
卷号	46 期号:5 页码:351-351
摘要	Degree preserving edge rewiring is extensively used in network topology researches to explore the graph space that encompasses all simple graphs with the prescribed degree sequence. The traversability of this graph space under the simple degree preserving rewiring operation is proved and the upper bound rewiring steps required to transform from one graph to the other are given.
DOI	10.1049/el.2010.3411
收录类别	SCI
语种	英语
WOS研究方向	Engineering
WOS类目	Engineering, Electrical & Electronic
WOS记录号	WOS:000275830400024
出版者	INST ENGINEERING TECHNOLOGY-IET
引用统计	被引频次：4[WOS] [WOS记录] [WOS相关记录]
文献类型	期刊论文
条目标识符	http://119.78.100.204/handle/2XEOYT63/12368
专题	中国科学院计算技术研究所期刊论文_英文
通讯作者	Zhang, G.
作者单位	Chinese Acad Sci, Inst Comp Technol, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Zhang, G.. Traversability of graph space with given degree sequence under edge rewiring[J]. ELECTRONICS LETTERS,2010,46(5):351-351.
APA	Zhang, G..(2010).Traversability of graph space with given degree sequence under edge rewiring.ELECTRONICS LETTERS,46(5),351-351.
MLA	Zhang, G.."Traversability of graph space with given degree sequence under edge rewiring".ELECTRONICS LETTERS 46.5(2010):351-351.