Universal sequences and graph cover times A short survey

Andrei Broder
Additional contact information
Andrei Broder: DEC — Systems Research Center

A chapter in Sequences, 1990, pp 109-122 from Springer

Abstract: Abstract Let G be a d-regular graph on n vertices. At each vertex v, let the edges incident with v be given the distinct labels 1,…,d. The labels at the two ends of an edge are not necessarily equal, that is, each edge is labeled twice. A sequence σ in {1,…, d}* is said to traverse G from v if, by starting from v and following the sequence of edge labels σ, one covers all the vertices of G. Let G n,d be a collection of d-regular graphs. A sequence σ is called universal for G n,d if it traverses every graph in G n,d , from every starting point v. For a given family G n,d , the length of the shortest universal sequence for G n,d is denoted U(G n,d )

Keywords: Random Walk; Complete Graph; Transition Probability Matrix; Universal Sequence; Random Regular Graph (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-3352-7_8

Ordering information: This item can be ordered from
http://www.springer.com/9781461233527

DOI: 10.1007/978-1-4612-3352-7_8

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().