𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimum degree, edge-connectivity and radius

✍ Scribed by Baoyindureng Wu, Xinhui An, Guojie Liu…

Book ID
120694147
Publisher
Springer US
Year
2012
Tongue
English
Weight
317 KB
Volume
26
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On graphs with equal edge-connectivity a
On graphs with equal edge-connectivity and minimum degree
✍ Donald L. Goldsmith; Arthur T. White 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 599 KB

It was proved by Chartrand f hat if G is a graph of order p for which the minimum degree is at least [&I, then the edge-connectivity of G equals the minimum degree of G. It is shown here that one may allow vertices of degree less than $p and still obtain the same conclusion, provided the degrees are

On graphs with equal edge connectivity a
On graphs with equal edge connectivity and minimum degree
✍ Béla Bollobás 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 255 KB

If a grrrph G hao edge connectivity A then the vertex fiat ha a partition V(a) = U U W ash that 61 esntainti exactly A edgea from U to W, Wen~se if Qo ia a maximal graph of order n and edge connectivity A than C$, is sbtctined from the dkjsint union of two complete oubgragh8, B,[U] and &T,[ Wg, by a

Radius, diameter, and minimum degree
Radius, diameter, and minimum degree
✍ Paul Erdős; János Pach; Richard Pollack; Zsolt Tuza 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 388 KB
Degree sequence conditions for equal edg
Degree sequence conditions for equal edge-connectivity and minimum degree, depending on the clique number
✍ Lutz Volkmann 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB

## Abstract Using the well‐known Theorem of Turán, we present in this paper degree sequence conditions for the equality of edge‐connectivity and minimum degree, depending on the clique number of a graph. Different examples will show that these conditions are best possible and independent of all the