Sciweavers

20 search results - page 1 / 4
» Rigid Components in Molecular Graphs
Sort
View
ALGORITHMICA
2007
82views more  ALGORITHMICA 2007»
13 years 5 months ago
Rigid Components in Molecular Graphs
In this paper we consider 3-dimensional generic bar-and-joint realizations of squares of graphs. These graphs are also called molecular graphs due to their importance in the study...
Bill Jackson, Tibor Jordán
CCCG
2009
13 years 6 months ago
Rigid Components of Random Graphs
We study the emergence of rigid components in an Erdos-R
Louis Theran
COMBINATORICA
2008
112views more  COMBINATORICA 2008»
13 years 4 months ago
On the rigidity of molecular graphs
The rigidity of squares of graphs in three-space has important applications to the study of flexibility in molecules. The Molecular Conjecture, posed in 1984 by T-S. Tay and W. Wh...
Bill Jackson, Tibor Jordán
JUCS
2007
105views more  JUCS 2007»
13 years 4 months ago
Graded Sparse Graphs and Matroids
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
Audrey Lee, Ileana Streinu, Louis Theran
CPC
2007
76views more  CPC 2007»
13 years 4 months ago
A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution
We study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n, p) in the critical window, that is, for p = n−1 + λn−4/...
Svante Janson, Joel Spencer