2-Switch-Degree in Graph Theory

• 2-switch-degree is a graph invariant defined as the number of active 2-switch moves that preserve a graph’s degree sequence.
• It is computed by counting induced 4-vertex subgraphs (P4, C4, and 2K2) with explicit formulas and parity properties.
• This invariant provides insights into graph rigidity, connectivity of realization spaces, and classifications like threshold and split graphs.

The 2-switch-degree of a graph $G$ is the degree of $G$ when $G$ is regarded as a vertex of the realization graph associated with its degree sequence; equivalently, it is the number of active 2-switches in $G$, or the number of distinct degree-preserving 2-switch moves that can be applied to $G$ while remaining within the same realization class (Pastine et al., 28 Nov 2025, Schvöllner, 17 Jul 2025). The concept turns a classical local rewiring operation into a graph invariant of the realization space itself. Recent work develops explicit counting formulas, activity criteria, additive laws under decomposition, and a detailed split-graph theory based on factor graphs and Tyshkevich decomposition (Pastine et al., 28 Nov 2025, Schvöllner, 17 Jul 2025).

1. Definition via realization graphs

Let $s=s(G)$ be the degree sequence of $G$. The realization graph $\mathcal{G}(s)$ has as vertices all labeled graphs with degree sequence $s$, and two realizations are adjacent when one is obtained from the other by a single 2-switch (Pastine et al., 28 Nov 2025). In this setting,

$\deg(G)=\deg_{\mathcal{G}(s)}(G).$

A 2-switch is defined on four distinct vertices $G$0 by

$G$1

When $G$2, the switch is active in $G$3; otherwise it is inactive (Pastine et al., 28 Nov 2025). The operation preserves the degree of each of the four involved vertices, hence preserves the degree sequence.

This definition fits the classical realization-space viewpoint. Berge’s theorem, quoted in the later literature, states that if $G$4 and $G$5 have the same degree sequence, then there exists a sequence of 2-switches transforming $G$6 into $G$7 (Pastine et al., 28 Nov 2025, Barrus, 2011). The 2-switch-degree therefore measures the one-step branching of $G$8 inside that connected realization graph.

2. Local combinatorial support on four vertices

Every active 2-switch is witnessed on an induced subgraph on four vertices. The only induced 4-vertex subgraphs that support an active 2-switch are $G$9, $G$0, and $G$1 (Pastine et al., 28 Nov 2025).

If $G$2 denotes the family of induced 4-vertex subgraphs of $G$3, then

$G$4

where $G$5 for $G$6 or $G$7, $G$8 for $G$9, and $G$0 otherwise (Pastine et al., 28 Nov 2025).

Induced $G$1-vertex subgraph	Contribution to $G$2
$G$3	$G$4
$G$5	$G$6
$G$7	$G$8

Hence the fundamental counting identity is

$G$9

This formula shows that 2-switch-degree is controlled entirely by induced subgraphs of order four (Pastine et al., 28 Nov 2025).

Several immediate consequences are recorded in the same work. First,

$G$0

so odd 2-switch-degree forces the existence of an induced $G$1. Second,

$G$2

because $G$3 is self-complementary and $G$4 and $G$5 are complements of one another (Pastine et al., 28 Nov 2025). Third, if $G$6, then $G$7, giving a monotonicity statement under induced subgraphs (Pastine et al., 28 Nov 2025).

3. Global formulas and behavior on standard graph families

The 2025 theory also gives formulas that combine local counting with degree-based invariants. Let

$G$8

be the number of unordered pairs of disjoint edges. Then

$G$9

and

$s=s(G)$0

where $s=s(G)$1, with equality iff

$s=s(G)$2

A central identity is

$s=s(G)$3

where $s=s(G)$4, $s=s(G)$5, and $s=s(G)$6 count induced $s=s(G)$7, $s=s(G)$8, and $s=s(G)$9, respectively (Pastine et al., 28 Nov 2025).

For disconnected graphs with connected components $G$0,

$G$1

Thus 2-switch-degree splits into intra-component activity plus switches using edges from different components (Pastine et al., 28 Nov 2025).

The parameter has especially explicit forms on sparse families. For a tree $G$2 with degree sequence $G$3,

$G$4

where $G$5 is the degree inside the forest realization graph, and

$G$6

In particular,

$G$7

For a unicyclic graph $G$8 with unique cycle $G$9 and forest part $\mathcal{G}(s)$0,

$\mathcal{G}(s)$1

equivalently

$\mathcal{G}(s)$2

and

$\mathcal{G}(s)$3

These formulas show that on trees and unicyclic graphs the parameter can be computed from standard combinatorial data (Pastine et al., 28 Nov 2025).

4. Activity, inactivity, and rigidity phenomena

The same literature distinguishes active and inactive vertices. If

$\mathcal{G}(s)$4

then a vertex $\mathcal{G}(s)$5 is active precisely when $\mathcal{G}(s)$6 lies in some induced copy of $\mathcal{G}(s)$7, $\mathcal{G}(s)$8, or $\mathcal{G}(s)$9; otherwise $s$0 is inactive (Pastine et al., 28 Nov 2025).

A notable rigidity result is that activity is preserved by 2-switches: $s$1 for every 2-switch $s$2. Consequently activity depends only on the degree sequence, and activity is constant on degree classes: if a vertex of degree $s$3 is active in a realization, then every vertex of degree $s$4 is active in that realization class (Pastine et al., 28 Nov 2025).

This perspective yields several structural characterizations. Threshold graphs are exactly the inactive graphs, so $s$5 is the realization-space signature of threshold structure (Pastine et al., 28 Nov 2025, Schvöllner, 17 Jul 2025). Universal vertices are inactive, and if a graph has no isolated vertices and contains an inactive vertex $s$6, then

$s$7

Moreover, if a graph without isolated vertices is not active, then

$s$8

and the bound is sharp (Pastine et al., 28 Nov 2025). The same work also states that if $s$9 is connected and regular, and not complete, then $\deg(G)=\deg_{\mathcal{G}(s)}(G).$0 is active (Pastine et al., 28 Nov 2025).

These results make 2-switch-degree a quantitative refinement of rigidity under degree-sequence constraints. Degree $\deg(G)=\deg_{\mathcal{G}(s)}(G).$1 means total local rigidity, while positive degree detects participation in one of the three canonical 4-vertex switching configurations.

5. Split graphs, factor graphs, and low-degree classification

Split graphs are central because their structure collapses the general counting problem. If $\deg(G)=\deg_{\mathcal{G}(s)}(G).$2 is split with partition

$\deg(G)=\deg_{\mathcal{G}(s)}(G).$3

into a clique and an independent set, then $\deg(G)=\deg_{\mathcal{G}(s)}(G).$4 contains no induced $\deg(G)=\deg_{\mathcal{G}(s)}(G).$5 or $\deg(G)=\deg_{\mathcal{G}(s)}(G).$6, so

$\deg(G)=\deg_{\mathcal{G}(s)}(G).$7

Thus, on split graphs the 2-switch-degree is exactly the number of induced $\deg(G)=\deg_{\mathcal{G}(s)}(G).$8’s (Schvöllner, 17 Jul 2025, Pastine et al., 28 Nov 2025).

The key tool introduced for this setting is the factor graph $\deg(G)=\deg_{\mathcal{G}(s)}(G).$9, a multigraph with vertex set $G$00. For distinct $G$01, the multiplicity of $G$02 is

$G$03

where

$G$04

This multiplicity counts the induced $G$05’s containing $G$06 and $G$07, equivalently the active 2-switches involving that pair. Consequently,

$G$08

with multiplicity counted in $G$09 (Schvöllner, 17 Jul 2025).

The split-graph theory is organized by Tyshkevich decomposition. Every graph has a unique decomposition

$G$10

into irreducible factors, with $G$11 split, and $G$12 split exactly when $G$13 is split (Schvöllner, 17 Jul 2025). The 2-switch-degree is additive under this composition: $G$14 and

$G$15

Within this framework, degree $G$16 split graphs are exactly the threshold graphs (Schvöllner, 17 Jul 2025).

A major consequence is a finite classification program for irreducible split graphs of small 2-switch-degree. By reducing the problem to connected unlabeled multigraphs $G$17 of fixed size, the paper fully classifies irreducible split graphs of degrees $G$18 and $G$19. The reported outcome is one irreducible split-graph shape at degree $G$20, two at degree $G$21, three at degree $G$22, and four at degree $G$23 (Schvöllner, 17 Jul 2025).

The same work also introduces the $G$24-property, defined via divisor-difference sets

$G$25

with $G$26 having property $G$27 when

$G$28

This number-theoretic condition is linked to the existence of $G$29-simple triangles in factor graphs of balanced split graphs (Schvöllner, 17 Jul 2025). The connection is presented as a structural bridge between 2-switch-degree theory on split graphs and arithmetic constraints on edge multiplicities.

6. Position within the broader 2-switch literature

The 2-switch-degree is a recent invariant, but it sits inside a much older 2-switch program. Classical work shows that graphs with the same degree sequence are connected by sequences of 2-switches, and later structural analysis identifies configurations in which a 2-switch changes isomorphism class (Barrus, 2011). This gives the realization graph $G$30 its basic connectivity and makes vertex degree in that graph a natural object of study.

Several adjacent literatures study restricted realization spaces rather than the scalar invariant $G$31. For forests, any two realizations with the same degree sequence can be transformed into one another by 2-switches while all intermediate graphs remain forests (Jaume et al., 2020). The same principle extends to unicyclic graphs and pseudoforests via $G$32-switches and $G$33-switches (Jaume et al., 2021, Schvöllner et al., 8 Mar 2026). In sampling theory, the switch Markov chain uses 2-switches to sample approximately uniformly from $G$34, with rapid mixing proved under explicit degree constraints such as

$G$35

for irregular graphs, and under 8-stability or related stability conditions for broader families, including heavy-tailed degree sequences (Greenhill, 2014, Gao et al., 2020). For directed realizations, 2-switches often suffice, but $G$36-anchored degree sequences require directed 3-cycle reorientation in addition to 2-switches (0912.3834). A different branch of the literature studies degree restricted 2-switches, proving that for diameter-2 graphs the invariant $G$37 is preserved exactly by sequences of such restricted moves (Benakli et al., 2019).

This broader context indicates that 2-switch-degree isolates one specific aspect of realization-space structure: the local number of admissible degree-preserving rewiring moves from a given realization. In recent graph-theoretic work, it has become a parameter in its own right, with exact formulas, decomposition laws, activity criteria, and a particularly rich split-graph classification (Pastine et al., 28 Nov 2025, Schvöllner, 17 Jul 2025).