Generative Structural Theory v1.148 — Classifying Reverse Connections with Six Deletions in Example P

This preprint classifies all reduced connections from W′ to W in Example P that use exactly six edge deletions in total. The endpoints and every intermediate state are minimally strongly connected digraphs on the same 21 labelled vertices. Each step may delete at most two directed edges and may add edges outside the union of the endpoints. Every such connection adds exactly five edges, takes three to five steps, and visits no state twice. Two programs using different enumeration methods found the same 2,012 labelled state sequences. Of these, 189 take three steps, 1,223 take four, and 600 take five. The 189 three-step connections recover the six-deletion case of v1.147. The 1,823 longer connections complete the classification. Together with the 21 minimum-deletion connections classified in v1.146, this gives 2,033 reduced connections with at most six deletions. Exactly 1,965 of the 2,012 six-deletion connections preserve every edge shared by W′ and W throughout. In each of the other 47, one shared edge is temporarily absent. The paper constructs a four-step connection in which the edge (r₀, r₁) is absent only from the second intermediate state and returns at the third step. The computational appendix provides the programs, inputs, complete state sequences, and instructions for reproducing the counts.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24359489
Primary Topic
Advanced Graph Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Generative Structural Theory v1.148 — Classifying Reverse Connections with Six Deletions in Example P

Koji Okino
Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Theory Research
preprint

Generative Structural Theory v1.148 — Classifying Reverse Connections with Six Deletions in Example P

Koji Okino
preprint en

Abstract

This preprint classifies all reduced connections from W′ to W in Example P that use exactly six edge deletions in total. The endpoints and every intermediate state are minimally strongly connected digraphs on the same 21 labelled vertices. Each step may delete at most two directed edges and may add edges outside the union of the endpoints. Every such connection adds exactly five edges, takes three to five steps, and visits no state twice. Two programs using different enumeration methods found the same 2,012 labelled state sequences. Of these, 189 take three steps, 1,223 take four, and 600 take five. The 189 three-step connections recover the six-deletion case of v1.147. The 1,823 longer connections complete the classification. Together with the 21 minimum-deletion connections classified in v1.146, this gives 2,033 reduced connections with at most six deletions. Exactly 1,965 of the 2,012 six-deletion connections preserve every edge shared by W′ and W throughout. In each of the other 47, one shared edge is temporarily absent. The paper constructs a four-step connection in which the edge (r₀, r₁) is absent only from the second intermediate state and returns at the third step. The computational appendix provides the programs, inputs, complete state sequences, and instructions for reproducing the counts.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon