Connectivity
2013 ◽
pp. 37-47
Keyword(s):
In this chapter, the concept of graph connectivity is introduced. In the first section, some concepts such as walk, path, component and connected graph are defined, and connectedness of a graph from the viewpoint of vertex connectivity, and also, edge connectivity are discussed. Then, blocks and block tree of graphs are illustrated. In addition, connectivity in directed graphs is introduced. Furthermore, in the last section, two graph traversal algorithms, depth first search and breadth first search, are described to investigate the connectedness of directed and undirected graphs.
Keyword(s):
Keyword(s):
2006 ◽
Vol 133
(31)
◽
pp. 1-5
◽
Keyword(s):
2004 ◽
Vol 19
(4)
◽
pp. 449-454