Show simple item record

dc.contributor.authorBalbuena Martínez, Maria Camino Teófila
dc.contributor.authorFàbrega Canudas, José
dc.contributor.authorFiol Mora, Miquel Àngel
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada III
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
dc.date.accessioned2014-03-12T12:00:55Z
dc.date.available2014-03-12T12:00:55Z
dc.date.created2013-12-05
dc.date.issued2013-12-05
dc.identifier.citationBalbuena, M.; Fàbrega, J.; Fiol, M. Connectivity: properties and structure. A: "Handbook of Graph Theory, Second Edition". CRC Press Taylor & Francis Group, 2013, p. 234-257.
dc.identifier.isbn978-1-4398-8018-0
dc.identifier.urihttp://hdl.handle.net/2117/22004
dc.description.abstractConnectivity is one of the central concepts of graph theory, from both a theoret- ical and a practical point of view. Its theoretical implications are mainly based on the existence of nice max-min characterization results, such as Menger’s theorems. In these theorems, one condition which is clearly necessary also turns out to be sufficient. Moreover, these results are closely related to some other key theorems in graph theory: Ford and Fulkerson’s theorem about flows and Hall’s theorem on perfect matchings. With respect to the applications, the study of connectivity parameters of graphs and digraphs is of great interest in the design of reliable and fault-tolerant interconnection or communication networks. Since graph connectivity has been so widely studied, we limit ourselves here to the presentation of some of the key results dealing with finite simple graphs and digraphs. For results about infinite graphs and connectivity algorithms the reader can consult, for instance, Aharoni and Diestel [AhDi94], Gibbons [Gi85], Halin [Ha00], Henzinger, Rao, and Gabow [HeRaGa00], Wigderson [Wi92]. For further details, we refer the reader to some of the good textbooks and surveys available on the subject: Berge [Be76], Bermond, Homobono, and Peyrat [BeHoPe89], Frank [Fr90, Fr94, Fr95], Gross and Yellen [GrYe06], Hellwig and Volkmann [HeVo08], Lov ´asz [Lo93], Mader [Ma79], Oellermann [Oe96], Tutte [Tu66].
dc.format.extent24 p.
dc.language.isoeng
dc.publisherCRC Press Taylor & Francis Group
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Combinatòria
dc.subject.lcshGraph theory
dc.subject.otherGraph Theory
dc.subject.otherConnectivity
dc.titleConnectivity: properties and structure
dc.typePart of book or chapter of book
dc.subject.lemacGrafs, Teoria de
dc.contributor.groupUniversitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.identifier.doi10.1201/b16132
dc.description.peerreviewedPeer Reviewed
dc.subject.ams05C Graph theory
dc.relation.publisherversionhttp://www.crcnetbase.com/doi/book/10.1201/b16132
dc.rights.accessOpen Access
local.identifier.drac13031238
dc.description.versionPostprint (published version)
local.citation.authorBalbuena, M.; Fàbrega, J.; Fiol, M.
local.citation.publicationNameHandbook of Graph Theory, Second Edition
local.citation.startingPage234
local.citation.endingPage257


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record