The 2-dimensional rigidity of certain families of graphs

Journal of Graph Theory

Volumn 54, Issue 2, 2007, Pages 154-166

  Jackson, Bill ^a   Servatius, Brigitte ^b   Servatius, Herman ^c  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^b WORCESTER POLYTECHNIC INSTITUTE   (United States)

^c CLARK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SET THEORY;

GENERIC FRAMEWORKS; GLOBAL RIGIDITY; RANDOM GRAPHS; TRANSITIVE GRAPHS;

GRAPH THEORY;

EID: 33846697443     PISSN: 03649024     EISSN: 10970118     Source Type: Journal    
DOI: 10.1002/jgt.20196     Document Type: Article

References (20)

1. B. Bollobas, Random graphs, in Surveys in combinatorics 1999, N. V. Temperley, (Editor), LMS Lecture Note Series 52, Cambridge University Press, Cambridge, UK, 1981, pp. 80-102.
2. B. Bollobás, Random graphs, Academic Press, New York, 1985.
3. R. Connelly, Generic global rigidity, discrete Comput Geom, 33(4) (2005), 549-563. http://www.springerlink.com/link.asp?id=TE8FBTNH8FGP
4. C. Cooper, A. Frieze, and B. Reed, Random regular graphs of non-constant degree, SIAM J Algebraic Discrete Methods 3(1) (1982), 91-98.
5. T. Eren, D. K. Goldenberg, W. Whiteley, Y. R. Yang, A. S. Morse, B. D. O. Andersen, and P. N. Belhumeur, Rigidity, computation, and randomization in network localization, preprint, http://citeseer.ist.psu.edu/eren04rigidity.html.
6. J. Graver, B. Servatius, and H. Servatius, Combinatorial rigidity, American Mathematical Society (1993).
7. B. Hendrickson, Conditions for unique graph realizations, SIAM J Comput 21(1) (1992), 65-84.
8. B. Jackson and T. Jordan, Connected rigidity matroids and unique realizations of graphs, J Combin Theory Ser B 94(1) (2005), 1-29.
9. M. Krivelevitch, B. Sudakov, V. H. Vu, and N. C. Wormald, Random regular graphs of high degree, SIAM J Algebraic Discrete Methods 3(1) (1982), 91-98.
10. G. Laman, On graphs and rigidity of plane skeletal structures, J Engrg Math 4 (1970), 331-340.
11. X-Y. Li, P-J. Wan, and Y. Wang, Fault tolerance deployment and topology control in wireless networks, in Proceedings of the ACM Symposium on Mobile Ad Hoc Networking and Computing (Mobihoc) (2003), Annapolis, MD, June 2003. http://www.sigmobile.org/mobihoc/2003/papers/p117-li.pdf
12. L. Lovász and Y. Yemini, On generic rigidity in the plane, SIAM J Algebraic Discrete Methods 3(1) (1982), 91-98.
13. T. Luczak, Size and connectivity of the k-core of a random graph, Discrete Math 91 (1991), 61-68.
14. W. Mader, Über den zusammenhang symmetrischer graphen, Archiv der Math 21 (1970), 331-336.
15. W. Mader, Minimale n-fach kantenzusammenhängende graphen, Math Ann 191 (1971), 21-28.
16. R. Tindell, Edge connectivity properties of symmetric graphs, Preprint, Stevens Institute of Technology, Hoboken, NJ (1982).
17. M. E. Watkins, Connectivity of transitive graphs, J Comb Th 8 (1970), 23-29.
18. W. Whiteley, Some matroids from discrete applied geometry, Matroid theory (Seattle, WA, 1995), 171-311, Contemp Math, 197, Amer Math Soc, Providence, RI, 1996.
19. N. C. Wormald, The asymptotic connectivity of labelled regular graphs, J Combin Theory Ser B 31(2) (1981), 156-167.
20. N. C. Wormald, "Models of random regular graphs", in Surveys in Combinatorics 1999, J. D. Lamb and D. A. Preece, (Editors), Cambridge University Press, Cambridge, 1999, pp. 239-298.