| 作成者 |
|
|
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
| 関連DOI |
|
|
|
|
|
| 関連URI |
|
|
|
|
|
| 関連情報 |
|
|
|
|
|
|
|
| 概要 |
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.続きを見る
|
Mendeley出力
JMI2010A-9