图集上随机游动的覆盖时

1) Postgraduate Education Office, GDUT, Guangzhou 5100902) Research Institute of CA, SCUT, Guangzhou, 510641

摘要： 研究了有限图上的简单随机游动对它的顶点至少访问一次所需的期望时间，得到了完全图的期望上界为Ｏ（ｎｌｏｇｎ），（其中ｎ为相应图的顶点数）对对称图，也给出了它的覆盖时的上、下界以上结论改进了原有的结果，是有关图集上随机游动的覆盖时研究有意义的新的成果

曾文曲；戴连贵； . 图集上随机游动的覆盖时[J]. 广东工业大学学报, 1998, 15(2): 82-88.

Zeng Wenqu1) Dai Liangui2). On the Cover Time of Random Walks on Graphs[J]. Journal of Guangdong University of Technology, 1998, 15(2): 82-88.

Viewed

Full text

2277

Abstract

207

Cited

Web of Science	Crossref	ScienceDirect	Search for Citations in Google Scholar >>


This page requires you have already subscribed to WoS.

Shared

Discussed

HTML