Abstract
Counting SAWs in a graph can be rather difficult. We want to reduce the number of walks to be counted by only considering so-called bridges, which form a subclass of all SAWs. The number of bridges of a given length lead to the bridge constant of a graph.
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
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer Fachmedien Wiesbaden GmbH, part of Springer Nature
About this chapter
Cite this chapter
Lindorfer, C. (2018). Graph height functions and bridges. In: The Language of Self-Avoiding Walks. BestMasters. Springer Spektrum, Wiesbaden. https://doi.org/10.1007/978-3-658-24764-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-658-24764-5_3
Published:
Publisher Name: Springer Spektrum, Wiesbaden
Print ISBN: 978-3-658-24763-8
Online ISBN: 978-3-658-24764-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)