Abstract
A walk in a graph G is a finite sequence of vertices x0, x1, ..., x n and edges a1, a2, ..., a n of G:
where the endpoints of a i are xi−1 and x i and x i for each i . A simple walk is a walk in which no edge is repeated. If it is desired to specify the terminal vertices, the above walk is called an x0x n -walk. The length of a walk is its number of edges.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2007 Second Edition, Birkhäuser Boston
About this chapter
Cite this chapter
Wallis, W.D. (2007). Walks, Paths and Cycles. In: A Beginner’s Guide to Graph Theory. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4580-9_2
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4580-9_2
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4484-0
Online ISBN: 978-0-8176-4580-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)