Home > Research > Publications & Outputs > Sufficient connectivity conditions for rigidity...

Research

Electronic data

  • Sufficient_Conn_Cond_EJC_Revised_2(1)

    Rights statement: This is the author’s version of a work that was accepted for publication in Physics Reports. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in European Journal of Combinatorics, 109, 2023 DOI: 10.1016/j.ejc.2022.103639

    Accepted author manuscript, 396 KB, PDF document

    Available under license: CC BY-NC-ND: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License

View graph of relations

Sufficient connectivity conditions for rigidity of symmetric frameworks

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Sufficient connectivity conditions for rigidity of symmetric frameworks. / Kaszanitzky, Viktoria; Schulze, Bernd.
In: European Journal of Combinatorics, Vol. 109, 103639, 31.03.2023.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Kaszanitzky, V & Schulze, B 2023, 'Sufficient connectivity conditions for rigidity of symmetric frameworks', European Journal of Combinatorics, vol. 109, 103639.

APA

Kaszanitzky, V., & Schulze, B. (2023). Sufficient connectivity conditions for rigidity of symmetric frameworks. European Journal of Combinatorics, 109, Article 103639.

Vancouver

Kaszanitzky V, Schulze B. Sufficient connectivity conditions for rigidity of symmetric frameworks. European Journal of Combinatorics. 2023 Mar 31;109:103639. Epub 2022 Dec 12.

Author

Kaszanitzky, Viktoria ; Schulze, Bernd. / Sufficient connectivity conditions for rigidity of symmetric frameworks. In: European Journal of Combinatorics. 2023 ; Vol. 109.

Bibtex

@article{6df6a80915174a1888e4c39122f051e5,
title = "Sufficient connectivity conditions for rigidity of symmetric frameworks",
abstract = "It is a famous result of Lov{\'a}sz and Yemini that 6-connected graphs are rigid in the plane (Lov{\'a}sz and Yemini, 1982). This was recently improved by Jackson and Jord{\'a}n (2009) who showed that 6-mixed connectivity is also sufficient for rigidity. Here we give sufficient graph connectivity conditions for both {\textquoteleft}forced symmetric{\textquoteright} and {\textquoteleft}incidentally symmetric{\textquoteright} infinitesimal rigidity in the plane.",
author = "Viktoria Kaszanitzky and Bernd Schulze",
note = "This is the author{\textquoteright}s version of a work that was accepted for publication in Physics Reports. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in European Journal of Combinatorics, 109, 2023 DOI: 10.1016/j.ejc.2022.103639",
year = "2023",
month = mar,
day = "31",
language = "English",
volume = "109",
journal = "European Journal of Combinatorics",
issn = "0195-6698",
publisher = "Academic Press Inc.",

}

RIS

TY - JOUR

T1 - Sufficient connectivity conditions for rigidity of symmetric frameworks

AU - Kaszanitzky, Viktoria

AU - Schulze, Bernd

N1 - This is the author’s version of a work that was accepted for publication in Physics Reports. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in European Journal of Combinatorics, 109, 2023 DOI: 10.1016/j.ejc.2022.103639

PY - 2023/3/31

Y1 - 2023/3/31

N2 - It is a famous result of Lovász and Yemini that 6-connected graphs are rigid in the plane (Lovász and Yemini, 1982). This was recently improved by Jackson and Jordán (2009) who showed that 6-mixed connectivity is also sufficient for rigidity. Here we give sufficient graph connectivity conditions for both ‘forced symmetric’ and ‘incidentally symmetric’ infinitesimal rigidity in the plane.

AB - It is a famous result of Lovász and Yemini that 6-connected graphs are rigid in the plane (Lovász and Yemini, 1982). This was recently improved by Jackson and Jordán (2009) who showed that 6-mixed connectivity is also sufficient for rigidity. Here we give sufficient graph connectivity conditions for both ‘forced symmetric’ and ‘incidentally symmetric’ infinitesimal rigidity in the plane.

M3 - Journal article

VL - 109

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

SN - 0195-6698

M1 - 103639

ER -