✦ LIBER ✦

When are random graphs connected

✍ Scribed by S. Kalikow; B. Weiss

Book ID: 112891798
Publisher: The Hebrew University Magnes Press
Year: 1988
Tongue: English
Weight: 432 KB
Volume: 62
Category: Article
ISSN: 0021-2172
DOI: 10.1007/bf02783296

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Highly connected random geometric graphs

✍ Paul Balister; Béla Bollobás; Amites Sarkar; Mark Walters 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 783 KB

When is NEPS of graphs connected?

✍ Dragan Stevanović 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 77 KB

We give the sufficient and necessary condition for the connectedness of non-complete extended p-sum (NEPS) of connected graphs, and we find the number of components of NEPS when it is disconnected. We show that the components of NEPS are mutually isomorphic and isomorphic to NEPS of the same non-bip

9-Connected Claw-Free Graphs Are Hamilto

9-Connected Claw-Free Graphs Are Hamilton-Connected

✍ Stephan Brandt 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 130 KB

A graph is Hamilton-connected if any pair of vertices is joined by a hamiltonian path. In this note it is shown that 9-connected graphs which contain no induced claw K 1, 3 are Hamilton-connected, by reformulating and localizing a closure concept due to Ryja c ek, which turns claw-free graphs into l

Connected graphs which are not mod sum g

Connected graphs which are not mod sum graphs

✍ Martin Sutton; Mirka Miller; Joseph Ryan; Slamin 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 321 KB

In this paper we prove that no wheel with the exception of W4 can be a mod sum graph. We also give the unique (up to multiplication by positive integers) mod sum labelling of W4. We also prove that the symmetric complete bipartite graph K,,,, is not a mod sum graph. (~) 1999 Elsevier Science B.V. Al

All 4-connected Line Graphs of Claw Free

All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected

✍ Matthias Kriesell 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 109 KB

Thomassen conjectured that every 4-connected line graph is hamiltonian. Here we shall see that 4-connected line graphs of claw free graphs are hamiltonian connected.

Five-Connected Toroidal Graphs Are Hamil

Five-Connected Toroidal Graphs Are Hamiltonian

✍ Robin Thomas; Xingxing Yu 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 518 KB

We prove that every edge in a 5-connected graph embedded in the torus is contained in a Hamilton cycle. Our proof is constructive and implies a polynomial time algorithm for finding a Hamilton cycle. ## 1997 Academic Press On the other hand, for 4-connected graphs embedded in the torus, certain ed