Apollonian network¶

A recursively generated planar graph formed by repeatedly inserting a vertex into a triangular face and joining it to that face’s three vertices.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3310
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Graph Theory → Mathematics

Core Idea¶

An Apollonian network begins with a triangle and applies a face-subdivision rule that preserves maximal planarity while creating a hierarchical scale-free graph. Each insertion replaces one triangular face by three smaller faces, so construction history induces nested communities and characteristic degree growth. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of graph theory. It is the domain-specific identity determined by the graph is obtainable from the seed triangle by repeated degree-three insertion into existing triangular faces.

How would you explain it like I'm…

Triangles Inside Triangles

Draw a triangle. Put a dot inside it and connect that dot to all three corners, which makes three smaller triangles. Then pick a triangle and do the same thing again, over and over. The web of dots and lines you get is an Apollonian network.

Dots Inside Triangles

Start with a triangle made of three dots joined by lines. Put a new dot inside the triangle and connect it to all three corners, which cuts it into three smaller triangles. Then pick any triangle and do the same thing again, and keep going. The lines never have to cross, and every space ends up being a triangle. Because some dots keep getting picked as corners, a few dots end up with lots of connections while most have only a few, and the building order leaves nested groups inside groups.

Recursive Triangle-Subdivision Graph

An Apollonian network is a graph (dots called vertices joined by lines called edges) built by one repeated rule. Start with a triangle. At each step, choose a triangular face, place a new vertex inside it, and connect it to the three corners of that face; this replaces the face with three smaller triangular faces. Every graph made this way is planar (drawable without crossing edges) and maximal planar, meaning you couldn't add another edge without a crossing. The construction history creates nested communities, and older vertices keep gaining edges, so the degrees become very uneven in a scale-free, hierarchical pattern. A graph only counts as an Apollonian network if it can actually be produced from the seed triangle by this degree-three insertion rule.

An Apollonian network is a graph generated from a seed triangle by repeatedly choosing an existing triangular face, inserting a new vertex inside it, and joining that vertex to the face's three corners. Each insertion adds a degree-three vertex and replaces one triangular face with three, so the graph stays maximal planar at every step. The recursion gives the graph a hierarchical structure: the construction history induces nested communities, and vertices present early keep acquiring neighbors as their incident faces are subdivided, producing characteristic heavy-tailed degree growth often described as scale-free. The constitutive test is membership: the graph must be obtainable from the seed triangle by repeated degree-three insertion into existing triangular faces. Being planar, triangulated, or scale-free on its own is not enough to qualify.

Scope of Application¶

Apollonian network belongs to graph theory and is useful where the analyst can specify the typed graph theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases and comparison targets, then evaluate the graph is obtainable from the seed triangle by repeated degree-three insertion into existing triangular faces. The scope is broad within that domain but bounded by the need for the graph is obtainable from the seed triangle by repeated degree-three insertion into existing triangular faces. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the graph is obtainable from the seed triangle by repeated degree-three insertion into existing triangular faces the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Apollonian network can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Apollonian network. Apollonian network compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed graph theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the graph is obtainable from the seed triangle by repeated degree-three insertion into existing triangular faces independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of graph theory because they reuse the typed graph theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases and comparison targets, Each insertion replaces one triangular face by three smaller faces, so construction history induces nested communities and characteristic degree growth., and type the carrier, state every parameter and convention in the definition, test that the graph is obtainable from the seed triangle by repeated degree-three insertion into existing triangular faces, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Apollonian network Domain-specific

Parents (1) — outgoing typed relations

Apollonian network is a kind of Recursion Prime

What makes it its own entry: the domain-specific identity determined by the graph is obtainable from the seed triangle by repeated degree-three insertion into existing triangular faces.

Hierarchy path (1) — routes to 1 parentless root

Apollonian network → is a kind of Recursion

Neighborhood in Abstraction Space¶

Apollonian network sits in a crowded region of the domain-specific corpus (8^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Graph Theory Structures & Invariants (48 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25