[Paper Review] Henneberg constructions and covers of cone-Laman graphs

Louis Theran|arXiv (Cornell University)|Apr 2, 2012

Structural Analysis and Optimization20 references3 citations

TL;DR

This paper provides Henneberg-type inductive constructions for three families of sparse colored graphs—Ross, cone-Laman, and cylinder-Laman graphs—arising in the rigidity theory of periodic and symmetric frameworks. By leveraging Laman-sparse finite covers and the ρ-rank of subgraphs, the authors establish inductive characterizations using moves (H1c), (H1c′), and (H2c), extending classical Henneberg constructions to matroidal sparse colored families with group-colored edges.

ABSTRACT

We give Henneberg-type constructions for three families of sparse colored graphs arising in the rigidity theory of periodic and other forced symmetric frameworks. The proof method, which works with Laman-sparse finite covers of colored graphs highlights the connection between these sparse colored families and the well-studied matroidal (k, l)-sparse families.

Motivation & Objective

• To provide inductive, Henneberg-type constructions for three families of sparse colored graphs relevant to periodic and symmetric framework rigidity.
• To establish a connection between these colored sparse families and the well-known $(k,\ell)$-sparse matroidal families through finite covers.
• To generalize classical Henneberg constructions to colored graphs with abelian group colors ($\mathbb{Z}^{2}$, $\mathbb{Z}/p\mathbb{Z}$, $\mathbb{Z}$) using the ρ-rank invariant.
• To resolve open questions on inductive characterizations for cone-Laman graphs beyond prime-order cyclic groups.
• To explore the combinatorial structure of colored graph matroids and their potential generalization via matroid lifts.

Proposed method

• Define colored graphs as edge-labeled graphs with colors from abelian groups $\Gamma \in \{\mathbb{Z}/p\mathbb{Z}, \mathbb{Z}, \mathbb{Z}/p\mathbb{Z} \times \mathbb{Z}/q\mathbb{Z}, \mathbb{Z}^2\}$, and introduce the ρ-rank of subgraphs as the rank of the image of the cycle space homomorphism to $\Gamma$.
• Introduce three sparsity conditions: Ross-sparse ($m' \leq 2n' - 3c'_0 - 2(c'_1 + c'_2)$), cone-Laman-sparse ($m' \leq 2n' - 3c'_0 - c'_1 - c'_2$), and cylinder-Laman-sparse ($m' \leq 2n' + r - 3c'_0 - 2(c'_1 + c'_2)$), where $r$ is the ρ-rank of the subgraph.
• Use the edge-doubling trick and submodular function theory to analyze lifts of colored graphs to finite covers, relating them to Laman-sparse graphs.
• Prove that cone-Laman graphs over $\mathbb{Z}/p\mathbb{Z}$ are equivalent to Laman-sparse lifts when $p$ is large enough, enabling inductive constructions.
• Apply the Tutte-Nash-Williams theorem to show that the (H2c) move preserves $(2,2)$-spanning property, crucial for cylinder-Laman graphs.
• Adapt the proof technique from cone-Laman to Ross graphs by using $\mathbb{Z}/p\mathbb{Z} \times \mathbb{Z}/q\mathbb{Z}$-colorings and refining Lemma 2.2 to relate lift connectivity to the index of the ρ-image.

Experimental results

Research questions

• RQ1 Can a Henneberg construction be given for cone-Laman graphs with colors in $\mathbb{Z}/k\mathbb{Z}$ for arbitrary $k \geq 2$, not just prime $p$?
• RQ2 What is the inductive characterization of Ross-circuits in fixed-lattice periodic frameworks, and can (H2c) and 2-sum operations suffice?
• RQ3 Can sparsity matroids on colored graphs be characterized via a general matroid lift construction that abstracts away from explicit edge coloring?

Key findings

• A colored graph with $\mathbb{Z}^2$-colors is a Ross-graph if and only if it can be constructed from a base graph using moves (H1c) and (H2c).
• A $\mathbb{Z}/p\mathbb{Z}$-colored graph is a cone-Laman graph if and only if it can be built from a base using (H1c), (H1c′), and (H2c), for odd prime $p$.
• A $\mathbb{Z}$-colored graph is a cylinder-Laman graph if and only if it can be constructed from a base using (H1c) and (H2c), and such graphs are exactly the cone-Laman graphs with a $(2,2)$-spanning underlying graph.
• For sufficiently large prime $p$, a $\mathbb{Z}$-colored cone-Laman graph is equivalent to a $\mathbb{Z}/p\mathbb{Z}$-colored cone-Laman graph, due to bounded color magnitudes in reverse moves.
• The (H2c) move preserves the $(2,2)$-spanning property in both forward and reverse directions, as shown via the Tutte-Nash-Williams theorem.
• A $\mathbb{Z}/p\mathbb{Z} \times \mathbb{Z}/q\mathbb{Z}$-colored graph with $2n-1$ edges is cone-Laman if and only if its lift is Laman-sparse, refining the relationship between colored and uncolored sparsity.