Cut Sets and Cut Vertices
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.
KeywordsGraph Theory Span Tree Connected Graph Proper Subset Transportation Network
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
© Springer India 2013