𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The 2-dimensional rigidity of certain families of graphs

✍ Scribed by Bill Jackson; Brigitte Servatius; Herman Servatius

Publisher
John Wiley and Sons
Year
2006
Tongue
English
Weight
168 KB
Volume
54
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Laman's characterization of minimally rigid 2‐dimensional generic frameworks gives a matroid structure on the edge set of the underlying graph, as was first pointed out and exploited by L. Lovász and Y. Yemini. Global rigidity has only recently been characterized by a combination of two results due to T. Jordán and the first named author, and R. Connelly, respectively. We use these characterizations to investigate how graph theoretic properties such as transitivity, connectivity and regularity influence (2‐dimensional generic) rigidity and global rigidity and apply some of these results to reveal rigidity properties of random graphs. In particular, we characterize the globally rigid vertex transitive graphs, and show that a random d‐regular graph is asymptotically almost surely globally rigid for all d ≥ 4. © 2006 Wiley Periodicals, Inc. J Graph Theory 54: 154–166, 2007

📜 SIMILAR VOLUMES

The L-series of Certain Rigid Calabi–Yau
The L-series of Certain Rigid Calabi–Yau Threefolds
✍ H.A Verrill 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 274 KB

The L-series of two Calabi Yau three-folds are found. In each case it is shown that the middle cohomology has dimension 2, and that (up to Euler factors at primes of bad reduction) the Mellin transform of the L-series of the middle cohomology is given by a modular form of weight four.

Classification of certain subgraphs of t
Classification of certain subgraphs of the 3-dimensional grid
✍ Jan Kristian Haugland 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 190 KB

## Abstract We prove by “trial‐ and‐error” that up to isometry, there are exactly four different non‐empty cubic induced subgraphs of the 3‐dimensional grid with girth ≥ 10. © 2002 Wiley Periodicals, Inc. J Graph Theory 42: 34–60, 2003

Families of graphs complete for the stro
Families of graphs complete for the strong perfect graph Conjecture
✍ D. G. Corneil 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 381 KB 👁 1 views

The Strong Perfect Graph Conjecture states that a graph is perfect iff neither it nor its complement contains an odd chordless cycle of size greater than or equal to 5. In this article it is shown that many families of graphs are complete for this conjecture in the sense that the conjecture is true