<journal article>
Exact computation for the cover times of certain classes of trees

Creator
Language
Publisher
Date
Source Title
Vol
Issue
First Page
Last Page
Publication Type
Access Rights
Related DOI
Related DOI
Related URI
Relation
Abstract We show a special feature for the cover time of trees that is not satisfied by those of other graphs. By using this property, we show the relationship between the cover times of a tree and its subdivi...sion, and we compute exactly the distribution of the last vertex visited by a random walk, the expectation and the Laplace transform of cover times of spider graphs as integral representations. We also discuss some comparison results for spider graphs.show more

Hide fulltext details.

pdf JMI2010A-9 pdf 132 KB 245  

Details

Record ID
Peer-Reviewed
Subject Terms
Notes
Type
Created Date 2010.10.28
Modified Date 2020.11.27

People who viewed this item also viewed