5714Accesses
Abstract
Awalk in a graphG is a finite sequence of verticesx0,x1, ...,xn and edgesa1,a2, ...,an ofG:
where the endpoints ofai arexi−1 andxi andxi for eachi . Asimple walk is a walk in which no edge is repeated. If it is desired to specify the terminal vertices, the above walk is called anx0xn-walk. Thelength of a walk is its number of edges.
This is a preview of subscription content,log in via an institution to check access.
Access this chapter
Subscribe and save
- Get 10 units per month
- Download Article/Chapter or eBook
- 1 Unit = 1 Article or 1 Chapter
- Cancel anytime
Buy Now
- Chapter
- JPY 3498
- Price includes VAT (Japan)
- eBook
- JPY 6291
- Price includes VAT (Japan)
- Softcover Book
- JPY 7864
- Price includes VAT (Japan)
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
Department of Mathematics, Southern Illinois University, Carbondale, IL, 62901-4408, USA
W. D. Wallis
- W. D. Wallis
Search author on:PubMed Google Scholar
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
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)
Share this chapter
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative