Generative Structural Theory v1.145 — Shortest Reverse Connections Beyond the Two-Cycle Family in Example P

Are there shortest reverse connections from W′ to W in Example P beyond the 20 constructed in v1.144? This preprint gives nine more. The endpoints W′ and W are minimally strongly connected directed graphs on the same 21 vertices. Every intermediate graph must also be minimally strongly connected, and each step may delete at most two directed edges. The vertex v belongs to both W′ and W. Their respective base graphs K′ and K share nine directed paths of the form x → c → y used in this construction. For each path, adding the parallel path x → v → y to K′ and to K gives the two intermediate states of a three-step connection from W′ to W. One of the nine connections deletes five edges in total and uses one distinct edge outside W ∪ W′. Each of the other eight deletes six edges and uses two distinct edges outside that union. Together with v1.144, this gives at least 29 distinct shortest reverse connections, at least five of which attain the minimum of five deletions. The lower bounds of three steps and five deletions come from Corollary G3 of v1.144 and depend on fixed-instance checks reported in v1.141 and v1.142. A complete classification remains open.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24356568
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.145 — Shortest Reverse Connections Beyond the Two-Cycle Family in Example P

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

Generative Structural Theory v1.145 — Shortest Reverse Connections Beyond the Two-Cycle Family in Example P

Koji Okino
preprint en

Abstract

Are there shortest reverse connections from W′ to W in Example P beyond the 20 constructed in v1.144? This preprint gives nine more. The endpoints W′ and W are minimally strongly connected directed graphs on the same 21 vertices. Every intermediate graph must also be minimally strongly connected, and each step may delete at most two directed edges. The vertex v belongs to both W′ and W. Their respective base graphs K′ and K share nine directed paths of the form x → c → y used in this construction. For each path, adding the parallel path x → v → y to K′ and to K gives the two intermediate states of a three-step connection from W′ to W. One of the nine connections deletes five edges in total and uses one distinct edge outside W ∪ W′. Each of the other eight deletes six edges and uses two distinct edges outside that union. Together with v1.144, this gives at least 29 distinct shortest reverse connections, at least five of which attain the minimum of five deletions. The lower bounds of three steps and five deletions come from Corollary G3 of v1.144 and depend on fixed-instance checks reported in v1.141 and v1.142. A complete classification remains open.

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