{"id":{"repo_id":"aachen","oai_identifier":"oai:publications.rwth-aachen.de:62244"},"canonical_url":"https://search.dev.ndltd.org/etd/aachen/oai:publications.rwth-aachen.de:62244","repository":{"repo_id":"aachen","name":"RWTH Aachen University","base_url":"https://publications.rwth-aachen.de/oai2d"},"display":{"title":"Maximally connected graphs and digraphs","abstract":"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 degree of the graph. Further connectivity parameters are the restricted edge-connectivity, the local-edge-connectivity and the p-q-restricted edge(vertex)-connectivity. In this thesis, we mainly study sufficient conditions for these connectivity parameters to be maximal. In Chapter 2,3,4 and 6 we generalize some known results by Goldsmith and Entringer and by Dankelmann and Volkmann. Furthermore we give analogue results to Xu's theorem for bipartite graphs. In Chapter 5 and 8 we characterize the graphs, where the parameters p-q-restricted edge-connectivity and p-q-restricted vertex-connectivity exists. In Chapter 9 we study the relations between edge- and vertex-connectivity parameters.","abstract_html":"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 degree of the graph. Further connectivity parameters are the restricted edge-connectivity, the local-edge-connectivity and the p-q-restricted edge(vertex)-connectivity. In this thesis, we mainly study sufficient conditions for these connectivity parameters to be maximal. In Chapter 2,3,4 and 6 we generalize some known results by Goldsmith and Entringer and by Dankelmann and Volkmann. Furthermore we give analogue results to Xu's theorem for bipartite graphs. In Chapter 5 and 8 we characterize the graphs, where the parameters p-q-restricted edge-connectivity and p-q-restricted vertex-connectivity exists. In Chapter 9 we study the relations between edge- and vertex-connectivity parameters.","abstract_has_math":false,"creators":["Hellwig, Angelika"],"institution":"Publikationsserver der RWTH Aachen University","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Volkmann, Lutz"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2005,"date_issued":"2005","date_published":"2005","updated_at":"2026-07-30T19:43:19Z","subjects":["info:eu-repo/classification/ddc/510","Zusammenhängender Graph","Digraph","Mathematik","Graph Theory","Connectivity","Edge-connectivity"],"languages":["eng"],"rights":["info:eu-repo/semantics/openAccess"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-123823%22"],"render_values":[{"text":"https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-123823%22","href":"https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-123823%22","code":true}]}]},"links":{"outbound_url":"https://publications.rwth-aachen.de/record/62244","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Volkmann, Lutz"]},{"key":"dc:creator","label":"Author","values":["Hellwig, Angelika"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:coverage","label":"Dc Coverage","values":["DE"]},{"key":"dc:date","label":"Dc Date","values":["2005"]},{"key":"dc:publisher","label":"Institution","values":["Publikationsserver der RWTH Aachen University"]},{"key":"dc:relation","label":"Dc Relation","values":["info:eu-repo/semantics/altIdentifier/urn/urn:nbn:de:hbz:82-20050846"]},{"key":"dc:type","label":"Dc Type","values":["info:eu-repo/semantics/doctoralThesis","info:eu-repo/semantics/publishedVersion"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["info:eu-repo/classification/ddc/510","Zusammenhängender Graph","Digraph","Mathematik","Graph Theory","Connectivity","Edge-connectivity"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["info:eu-repo/semantics/openAccess"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://publications.rwth-aachen.de/record/62244","https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-123823%22"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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 degree of the graph. Further connectivity parameters are the restricted edge-connectivity, the local-edge-connectivity and the p-q-restricted edge(vertex)-connectivity. In this thesis, we mainly study sufficient conditions for these connectivity parameters to be maximal. In Chapter 2,3,4 and 6 we generalize some known results by Goldsmith and Entringer and by Dankelmann and Volkmann. Furthermore we give analogue results to Xu's theorem for bipartite graphs. In Chapter 5 and 8 we characterize the graphs, where the parameters p-q-restricted edge-connectivity and p-q-restricted vertex-connectivity exists. In Chapter 9 we study the relations between edge- and vertex-connectivity parameters."]},{"key":"dc:source","label":"Dc Source","values":["Aachen : Publikationsserver der RWTH Aachen University II, 105 S. (2005). = Aachen, Techn. Hochsch., Diss., 2005"]},{"key":"dc:title","label":"Title","values":["Maximally connected graphs and digraphs"]}]}],"canonical_facts":{"dc:contributor":["Volkmann, Lutz"],"dc:coverage":["DE"],"dc:creator":["Hellwig, Angelika"],"dc:date":["2005"],"dc:description":["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 degree of the graph. Further connectivity parameters are the restricted edge-connectivity, the local-edge-connectivity and the p-q-restricted edge(vertex)-connectivity. In this thesis, we mainly study sufficient conditions for these connectivity parameters to be maximal. In Chapter 2,3,4 and 6 we generalize some known results by Goldsmith and Entringer and by Dankelmann and Volkmann. Furthermore we give analogue results to Xu's theorem for bipartite graphs. In Chapter 5 and 8 we characterize the graphs, where the parameters p-q-restricted edge-connectivity and p-q-restricted vertex-connectivity exists. In Chapter 9 we study the relations between edge- and vertex-connectivity parameters."],"dc:identifier":["https://publications.rwth-aachen.de/record/62244","https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-123823%22"],"dc:language":["eng"],"dc:publisher":["Publikationsserver der RWTH Aachen University"],"dc:relation":["info:eu-repo/semantics/altIdentifier/urn/urn:nbn:de:hbz:82-20050846"],"dc:rights":["info:eu-repo/semantics/openAccess"],"dc:source":["Aachen : Publikationsserver der RWTH Aachen University II, 105 S. (2005). = Aachen, Techn. Hochsch., Diss., 2005"],"dc:subject":["info:eu-repo/classification/ddc/510","Zusammenhängender Graph","Digraph","Mathematik","Graph Theory","Connectivity","Edge-connectivity"],"dc:title":["Maximally connected graphs and digraphs"],"dc:type":["info:eu-repo/semantics/doctoralThesis","info:eu-repo/semantics/publishedVersion"]},"updated_at":"2026-07-30T19:43:19Z"}