𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimum 3-geodetically connected graphs

✍ Scribed by Martina Bosı́ková

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
793 KB
Volume
129
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

✦ Synopsis

A graph G is k-geodetically connected (k-GC) if it is connected and the removal of at least k vertices is required to increase the distance between at least one pair of vertices or reduce G to a single vertex. We completely characterize the class of minimum 3-GC graphs that have the fewest edges for a given number of vertices.

📜 SIMILAR VOLUMES

The recognition of geodetically connecte
The recognition of geodetically connected graphs
✍ Jou-Ming Chang; Chin-Wen Ho 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 849 KB

Let G = ( y E) be a graph with vertex set V of size n and edge set E of size m. A vertex LJ E V is called a hinge vertex if the distance of any two vertices becomes longer after u is removed. A graph without hinge vertex is called a hinge-free graph. In general, a graph G is k-geodetically connected

Hamiltonicity and Minimum Degree in 3-co
Hamiltonicity and Minimum Degree in 3-connected Claw-Free Graphs
✍ Odile Favaron; Pierre Fraisse 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 112 KB

Using Ryja c ek's closure, we prove that any 3-connected claw-free graph of order & and minimum degree $ &+38 10 is hamiltonian. This improves a theorem of Kuipers and Veldman who got the same result with the stronger hypotheses $ &+29 8 and & sufficiently large and nearly proves their conjecture sa

Extremal 3-connected graphs
Extremal 3-connected graphs
✍ Stephen C. Locke 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 686 KB

Let G be a 3-connected graph with minimum degree at least d and at least 2d vertices. For any three distinct vertices X, y, z there is a path from x to z through y and having length at least M -2. In this paper, we characterize those graphs for which no such path has length exceeding 2d -2. ## I.

Cyclability of 3-connected graphs
Cyclability of 3-connected graphs
✍ Amel Harkat-Benhamdine; Hao Li; Feng Tian 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB 👁 1 views