Abstract
In this chapter, we find a type of subgraph of a graph G where removal from G separates some vertices from others in G. This type of subgraph is known as cut set of G. Cut set has a great application in communication and transportation networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 Springer India
About this chapter
Cite this chapter
Saha Ray, S. (2013). Cut Sets and Cut Vertices. In: Graph Theory with Algorithms and its Applications. Springer, India. https://doi.org/10.1007/978-81-322-0750-4_7
Download citation
DOI: https://doi.org/10.1007/978-81-322-0750-4_7
Published:
Publisher Name: Springer, India
Print ISBN: 978-81-322-0749-8
Online ISBN: 978-81-322-0750-4
eBook Packages: EngineeringEngineering (R0)