On Vertices of Degree n in Minimally n-Edge-Connected Graphs

Show simple item record

dc.identifier.uri http://dx.doi.org/10.15488/3612
dc.identifier.uri https://www.repo.uni-hannover.de/handle/123456789/3644
dc.contributor.author Mader, W.
dc.date.accessioned 2018-08-23T12:15:43Z
dc.date.available 2018-08-23T12:15:43Z
dc.date.issued 1995
dc.identifier.citation Mader, W.: On Vertices of Degree n in Minimally n-Edge-Connected Graphs. In: Combinatorics, Probability and Computing 4 (1995), Nr. 1, S. 81-95. DOI: https://doi.org/10.1017/S0963548300001498
dc.description.abstract Let G be a minimally n-edge-connected finite simple graph with vertex number |G| ≥ 2n + 2 + [3/n] and let n ≥ 3 be odd. It is proved that the number of vertices of degree n in G is at least ((n − 1 − ∈n)/(2n + 1))|G| + 2 + 2∈n, where ∈n = (3n + 3)/(2n2 − 3n − 3), and that for every n ≡ 3 (mod 4) this lower bound is attained by infinitely many minimally n-edge-connected finite simple graphs. © 1995, Cambridge University Press. All rights reserved. eng
dc.language.iso eng
dc.publisher Cambridge : Cambridge University Press
dc.relation.ispartofseries Combinatorics, Probability and Computing 4 (1995), Nr. 1
dc.rights Es gilt deutsches Urheberrecht. Das Dokument darf zum eigenen Gebrauch kostenfrei genutzt, aber nicht im Internet bereitgestellt oder an Außenstehende weitergegeben werden. Dieser Beitrag ist aufgrund einer (DFG-geförderten) Allianz- bzw. Nationallizenz frei zugänglich.
dc.subject Finite Simple Graph eng
dc.subject Vertices eng
dc.subject n-connected Graph eng
dc.subject.ddc 510 | Mathematik ger
dc.title On Vertices of Degree n in Minimally n-Edge-Connected Graphs
dc.type article
dc.type Text
dc.relation.issn 09635483
dc.relation.doi https://doi.org/10.1017/S0963548300001498
dc.bibliographicCitation.issue 1
dc.bibliographicCitation.volume 4
dc.bibliographicCitation.firstPage 81
dc.bibliographicCitation.lastPage 95
dc.description.version publishedVersion
tib.accessRights frei zug�nglich


Files in this item

This item appears in the following Collection(s):

Show simple item record

 

Search the repository


Browse

My Account

Usage Statistics