Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 1 of 1 for “"Zusammenhängender Graph"”.
-
Maximally connected graphs and digraphs
The graph theoretical parameter edge-connectivity equals the minimum number of edges, whose removal disconnects the graph. Analogously, the vertex-connectivity equals the minimum number of vertices, whose removal disconnects the graph. These parameters are maximal, if they are equal to the minimum …