Wedge Sums in Graph Theory

• Graph wedge sums are defined as the gluing of multiple graphs at a single distinguished vertex, resulting in a new connected graph with altered algebraic and topological properties.
• They preserve essential features such as connectivity, chromatic number, and cycle space decomposition, which underpin structure theorems and inductive proofs.
• Wedge sums are pivotal in classifying sesquicographs, decomposing independence complexes, and advancing applications in topological combinatorics and quantum graph theory.

A graph wedge sum, also known as the 1-sum or one-point union, is a fundamental operation in graph theory and topological combinatorics. It constructs a new connected graph by “gluing” several input graphs together at distinguished vertices, amalgamating these selected vertices into a unique shared point (“the wedge point”). The algebraic and topological properties of wedge sums have deep connections to independence complexes, graph minors, forbidden subgraph characterizations, and combinatorial constructions that underpin broader classes such as sesquicographs. The homotopical behavior of wedge sums, particularly regarding their independence complexes, renders these constructions central to inductive proofs and classification theorems for families of graphs and related simplicial complexes.

1. Definition and Formal Construction

Given a finite family of simple graphs $\{G_i=(V_i,E_i)\}_{i=1}^k$ and designated vertices $a_i\in V_i$, the wedge sum (or one-point union) $\bigvee_{i=1}^k G_i$ is formed by identifying all $a_i$ to a single new vertex $a$, the “wedge point.” Explicitly, the vertex set of the wedge is

$$V(\bigvee_{i=1}^k G_i) = \Bigl(\bigcup_i(V_i\setminus\{a_i\})\Bigr)\cup\{a\}$$

and the edge set is

$$E(\bigvee_{i=1}^k G_i) = \Bigl(\bigcup_i(E_i\setminus\{e\mid a_i\in e\})\Bigr)\cup\{\{a,b\}\mid \{a_i,b\}\in E_i\}.$$

Alternatively, for two graphs $G$ and $H$ with $V_G\cap V_H = \{v\}$, the 1-sum is $a_i\in V_i$0. The construction depends critically on the choice of wedge points; different choices produce non-isomorphic graphs and can yield non-homotopy-equivalent independence complexes (Daundkar et al., 2023, Singh, 2022).

2. Illustrative Examples

Several canonical examples illustrate the diversity of graphs obtainable as wedge sums:

• Wedge of Paths: Wedging end-vertices of $a_i\in V_i$1 and $a_i\in V_i$2 yields $a_i\in V_i$3, a path on six vertices: $a_i\in V_i$4.
• Wedge at Interior Vertices: Wedging at internal vertices (e.g., $a_i\in V_i$5 in $a_i\in V_i$6, $a_i\in V_i$7 in $a_i\in V_i$8) produces a “T”-shaped graph.
• Wedge of Cycles: Wedging $a_i\in V_i$9 and $\bigvee_{i=1}^k G_i$0 at vertices yields a “figure-eight”—two cycles glued at a single point.
• Path-Cycle Wedge (“Lollipop” Graphs): Joining $\bigvee_{i=1}^k G_i$1 at a vertex to the $\bigvee_{i=1}^k G_i$2-th vertex of $\bigvee_{i=1}^k G_i$3 produces non-isomorphic graphs as $\bigvee_{i=1}^k G_i$4 varies, known as “lollipop” graphs (Daundkar et al., 2023).

These examples underscore the role of the wedge sum in generating both familiar and novel combinatorial structures.

3. Algebraic and Graph-Theoretic Properties

The wedge sum exhibits operations that mirror core graph-theoretic properties:

• Commutativity and Associativity: The wedge sum is commutative and associative up to isomorphism, provided the identifications are compatible.
• Vertex and Edge Counts: For $\bigvee_{i=1}^k G_i$5, $\bigvee_{i=1}^k G_i$6 and $\bigvee_{i=1}^k G_i$7, where $\bigvee_{i=1}^k G_i$8 is the sum of the degrees of the original wedge points (removing double-counting of edges reattached to $\bigvee_{i=1}^k G_i$9).
• Connectivity: $a_i$0 is connected if and only if each $a_i$1 is connected.
• Chromatic Number: $a_i$2.
• Cycle Space: The cycle space of the wedge is the direct sum of the cycle spaces of the summands, all passing through the identified wedge point (Daundkar et al., 2023).

The operation is not idempotent: $a_i$3 is not isomorphic to $a_i$4.

4. Wedge Sums and the Structure of Graph Classes

Wedge sums are central to the recursive definition and decomposition of sesquicographs—graphs generated from $a_i$5 by 0-sum (disjoint union), 1-sum (wedge sum), and join operations. The class of sesquicographs is closed under induced minors and edge-contraction. A graph is a sesquicograph if and only if it contains none of the following as induced subgraphs: cycles $a_i$6 with $a_i$7, the path $a_i$8, the domino $a_i$9 plus one chord, or five specified order-6 graphs ($a$0–$a$1). Every proper induced subgraph of these forbidden minors admits a decomposition by the allowed operations (Singh, 2022).

The wedge sum, in particular, encodes “gluing at a single cut-vertex” and is indispensable in polynomial-time recognition algorithms and decompositional structure theorems.

5. Independence Complexes and Homotopy Decomposition

Given a graph $a$2, its independence complex $a$3 is the simplicial complex on $a$4 whose simplices are independent sets. For a wedge $a$5 at $a$6, the following facts hold:

• $a$7 (simplicial join).
• $a$8.

The deletion–link decomposition and the (homotopy) Fold Lemma enable inductive splitting of $a$9 into joins and suspensions:

$$V(\bigvee_{i=1}^k G_i) = \Bigl(\bigcup_i(V_i\setminus\{a_i\})\Bigr)\cup\{a\}$$0

Concrete results for paths and cycles include:

Graph Type	Independence Complex $$V(\bigvee_{i=1}^k G_i) = \Bigl(\bigcup_i(V_i\setminus\{a_i\})\Bigr)\cup\{a\}$$1	Reference
Wedge of $$V(\bigvee_{i=1}^k G_i) = \Bigl(\bigcup_i(V_i\setminus\{a_i\})\Bigr)\cup\{a\}$$2’s at endvertices	Point or $$V(\bigvee_{i=1}^k G_i) = \Bigl(\bigcup_i(V_i\setminus\{a_i\})\Bigr)\cup\{a\}$$3 (with $$V(\bigvee_{i=1}^k G_i) = \Bigl(\bigcup_i(V_i\setminus\{a_i\})\Bigr)\cup\{a\}$$4 periodic mod 3)	(Daundkar et al., 2023)
Wedge of $$V(\bigvee_{i=1}^k G_i) = \Bigl(\bigcup_i(V_i\setminus\{a_i\})\Bigr)\cup\{a\}$$5’s at a vertex	Contractible or wedge of one/two spheres (via $$V(\bigvee_{i=1}^k G_i) = \Bigl(\bigcup_i(V_i\setminus\{a_i\})\Bigr)\cup\{a\}$$6)	(Daundkar et al., 2023)
Finite wedge of paths or cycles	Contractible or wedge of spheres, dim. by mod 3 counts	(Daundkar et al., 2023)

Any finite wedge of paths and cycles yields an independence complex either contractible or a wedge of spheres, with explicit formulas available in terms of the lengths modulo 3 (Daundkar et al., 2023).

6. Extensions, Applications, and Further Directions

Applications and generalizations of the wedge sum include:

• Chromatic Number Constraints: The homotopy type of $$V(\bigvee_{i=1}^k G_i) = \Bigl(\bigcup_i(V_i\setminus\{a_i\})\Bigr)\cup\{a\}$$7 for wedge-constructed graphs offers potential lower bounds on chromatic number, paralleling Lovász’s neighborhood complex bounds.
• Graph Gluing and Hom Complexes: The wedge sum exemplifies one-dimensional gluing. Extensions to Hom complexes for $$V(\bigvee_{i=1}^k G_i) = \Bigl(\bigcup_i(V_i\setminus\{a_i\})\Bigr)\cup\{a\}$$8 and matching complexes are natural generalizations.
• Higher-Dimensional Analogues: Topological combinatorics uses analogous constructions for simplicial complexes, with wedge sums providing a 1-dimensional archetype.
• Quantum Graph Theory: Wedge sums inform computations in graph $$V(\bigvee_{i=1}^k G_i) = \Bigl(\bigcup_i(V_i\setminus\{a_i\})\Bigr)\cup\{a\}$$9-algebras, impacting K-theory via the structure of $$E(\bigvee_{i=1}^k G_i) = \Bigl(\bigcup_i(E_i\setminus\{e\mid a_i\in e\})\Bigr)\cup\{\{a,b\}\mid \{a_i,b\}\in E_i\}.$$0 under wedge formation (Daundkar et al., 2023).

A plausible implication is that inductive strategies leveraging wedge sums and independence complex decompositions will further unify graph and simplicial complex topology, particularly in the study of recursively constructed classes such as sesquicographs (Singh, 2022) and in combinatorial applications to coloring, homology, and configuration spaces.