Semi-symmetric graph

A regular undirected graph whose automorphism group is transitive on edges but not on vertices.

Version

v1 · 2026-09-08 · History

Domain-specific #

6642

Origin domain

graph theory

Subdomain

graph theory

Core Idea

A semi-symmetric graph combines regularity and edge transitivity with at least two vertex orbits, so all edges are structurally alike while not all vertices are. Edge transitivity maps incident pairs throughout the graph, regularity equalizes degrees, and failure of vertex transitivity typically preserves the two parts of a bipartition as separate orbits. 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.

Scope of Application

Semi-symmetric graph belongs to graph theory and is useful where the analyst can specify an undirected graph, vertex degree, automorphism group, orbits on vertices and edges, connectedness convention, bipartition, and incidence structure, then evaluate the graph is regular and edge-transitive but its automorphism group is not vertex-transitive. The scope is broad within that domain but bounded by the need for the graph is regular and edge-transitive but its automorphism group is not vertex-transitive. 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 regular and edge-transitive but its automorphism group is not vertex-transitive 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 Semi-symmetric graph 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 Semi-symmetric graph. Semi-symmetric graph 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

1. Identify the carrier. State what the elements, states, objects, or observations are: an undirected graph, vertex degree, automorphism group, orbits on vertices and edges, connectedness convention, bipartition, and incidence structure. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the graph is regular and edge-transitive but its automorphism group is not vertex-transitive independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of graph theory because they reuse an undirected graph, vertex degree, automorphism group, orbits on vertices and edges, connectedness convention, bipartition, and incidence structure, Edge transitivity maps incident pairs throughout the graph, regularity equalizes degrees, and failure of vertex transitivity typically preserves the two parts of a bipartition as separate orbits., and type the carrier, state every parameter and convention in the definition, test that the graph is regular and edge-transitive but its automorphism group is not vertex-transitive, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Current abstraction Semi-symmetric graph Domain-specific

Parents (1) — more general patterns this builds on

• Semi-symmetric graph is a kind of Symmetry Prime

  The proposed strict upward parent is prime:symmetry.

Hierarchy path (1) — routes to 1 parentless root

• Semi-symmetric graph → Symmetry

Neighborhood in Abstraction Space

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

Family — Graph Connectivity & Network Measures (31 abstractions)

Nearest neighbors

• Zero-symmetric graph — 0.94
• Asymmetric graph — 0.93
• Graph isomorphism — 0.93
• Component (graph theory) — 0.93
• Transitive reduction — 0.93

Computed from structural-signature embeddings · 2026-09-08