Highly connected rigidity matroids have unique underlying graphs

T. Jordán, Viktória E. Kaszanitzky

Research output: Contribution to journalArticle

Abstract

Let M be a d-dimensional generic rigidity matroid of some graph G. We consider the following problem, posed by Brigitte and Herman Servatius in 2006: is there a (smallest) integer k d such that the underlying graph G of M is uniquely determined, provided that M is k d-connected? Since the one-dimensional generic rigidity matroid of G is isomorphic to its cycle matroid, a celebrated result of Hassler Whitney implies that k 1 = 3. We extend this result by proving that k 2 ≤ 11. To show this we prove that (i) if G is 7-vertex-connected then it is uniquely determined by its two-dimensional rigidity matroid, and (ii) if a two-dimensional rigidity matroid is (2k - 3) -connected then its underlying graph is k-vertex-connected.We also prove the reverse implication: if G is a k-connected graph for some k ≥ 6 then its two-dimensional rigidity matroid is (k - 2) -connected. Furthermore, we determine the connectivity of the d-dimensional rigidity matroid of the complete graph K n, for all pairs of positive integers d, n.

Original languageEnglish
Pages (from-to)240-247
Number of pages8
JournalEuropean Journal of Combinatorics
Volume34
Issue number2
DOIs
Publication statusPublished - Feb 2013

Fingerprint

Matroid
Rigidity
Graph in graph theory
Integer
Vertex of a graph
Complete Graph
Connected graph
Reverse
Connectivity
Isomorphic
Imply
Cycle

ASJC Scopus subject areas

  • Geometry and Topology
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Highly connected rigidity matroids have unique underlying graphs. / Jordán, T.; Kaszanitzky, Viktória E.

In: European Journal of Combinatorics, Vol. 34, No. 2, 02.2013, p. 240-247.

Research output: Contribution to journalArticle

Jordán, T. ; Kaszanitzky, Viktória E. / Highly connected rigidity matroids have unique underlying graphs. In: European Journal of Combinatorics. 2013 ; Vol. 34, No. 2. pp. 240-247.
@article{489f874963d14c53b2617a27640ee114,
title = "Highly connected rigidity matroids have unique underlying graphs",
abstract = "Let M be a d-dimensional generic rigidity matroid of some graph G. We consider the following problem, posed by Brigitte and Herman Servatius in 2006: is there a (smallest) integer k d such that the underlying graph G of M is uniquely determined, provided that M is k d-connected? Since the one-dimensional generic rigidity matroid of G is isomorphic to its cycle matroid, a celebrated result of Hassler Whitney implies that k 1 = 3. We extend this result by proving that k 2 ≤ 11. To show this we prove that (i) if G is 7-vertex-connected then it is uniquely determined by its two-dimensional rigidity matroid, and (ii) if a two-dimensional rigidity matroid is (2k - 3) -connected then its underlying graph is k-vertex-connected.We also prove the reverse implication: if G is a k-connected graph for some k ≥ 6 then its two-dimensional rigidity matroid is (k - 2) -connected. Furthermore, we determine the connectivity of the d-dimensional rigidity matroid of the complete graph K n, for all pairs of positive integers d, n.",
author = "T. Jord{\'a}n and Kaszanitzky, {Vikt{\'o}ria E.}",
year = "2013",
month = "2",
doi = "10.1016/j.ejc.2012.09.001",
language = "English",
volume = "34",
pages = "240--247",
journal = "European Journal of Combinatorics",
issn = "0195-6698",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - Highly connected rigidity matroids have unique underlying graphs

AU - Jordán, T.

AU - Kaszanitzky, Viktória E.

PY - 2013/2

Y1 - 2013/2

N2 - Let M be a d-dimensional generic rigidity matroid of some graph G. We consider the following problem, posed by Brigitte and Herman Servatius in 2006: is there a (smallest) integer k d such that the underlying graph G of M is uniquely determined, provided that M is k d-connected? Since the one-dimensional generic rigidity matroid of G is isomorphic to its cycle matroid, a celebrated result of Hassler Whitney implies that k 1 = 3. We extend this result by proving that k 2 ≤ 11. To show this we prove that (i) if G is 7-vertex-connected then it is uniquely determined by its two-dimensional rigidity matroid, and (ii) if a two-dimensional rigidity matroid is (2k - 3) -connected then its underlying graph is k-vertex-connected.We also prove the reverse implication: if G is a k-connected graph for some k ≥ 6 then its two-dimensional rigidity matroid is (k - 2) -connected. Furthermore, we determine the connectivity of the d-dimensional rigidity matroid of the complete graph K n, for all pairs of positive integers d, n.

AB - Let M be a d-dimensional generic rigidity matroid of some graph G. We consider the following problem, posed by Brigitte and Herman Servatius in 2006: is there a (smallest) integer k d such that the underlying graph G of M is uniquely determined, provided that M is k d-connected? Since the one-dimensional generic rigidity matroid of G is isomorphic to its cycle matroid, a celebrated result of Hassler Whitney implies that k 1 = 3. We extend this result by proving that k 2 ≤ 11. To show this we prove that (i) if G is 7-vertex-connected then it is uniquely determined by its two-dimensional rigidity matroid, and (ii) if a two-dimensional rigidity matroid is (2k - 3) -connected then its underlying graph is k-vertex-connected.We also prove the reverse implication: if G is a k-connected graph for some k ≥ 6 then its two-dimensional rigidity matroid is (k - 2) -connected. Furthermore, we determine the connectivity of the d-dimensional rigidity matroid of the complete graph K n, for all pairs of positive integers d, n.

UR - http://www.scopus.com/inward/record.url?scp=84867135349&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867135349&partnerID=8YFLogxK

U2 - 10.1016/j.ejc.2012.09.001

DO - 10.1016/j.ejc.2012.09.001

M3 - Article

VL - 34

SP - 240

EP - 247

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

SN - 0195-6698

IS - 2

ER -