Generative Structural Theory v1.142 — Shortest Three-Step Connections in Example P

Can one minimally strongly connected directed graph be transformed into another if each step may delete at most two edges? For the two leaf lifts \(W\) and \(W′\) in Example P, the answer depends on the direction. From \(W\) to \(W′\), the shortest connection takes exactly three steps. From \(W′\) to \(W\), no connection exists under the same rules. Both graphs have the same 21 vertices. Every intermediate graph must be minimally strongly connected on those vertices and may use only edges from the union of \(W\) and \(W′\). Each step may add any edges from that union. Version 1.141 ruled out a two-step connection from \(W\) to \(W′\). This preprint constructs two three-step connections. They have different first intermediate states, \(W₁\) and \(W₂\), and share the same second intermediate state, \(Y\). Each route deletes one edge in the first step, two in the second, and two in the third. The proof of minimality for \(Y\) uses a general lemma on joining two minimally strongly connected directed graphs at a single shared vertex. A fixed-instance check over all 21 minimally strongly connected spanning subgraphs of the union shows that these are the only two shortest connections. It also establishes the reverse-direction result: no admissible first step leads from \(W′\) to a distinct state. The verification appendix includes the input from v1.141, the check program, and its recorded output for offline reproduction.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24283527
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.142 — Shortest Three-Step Connections in Example P

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

Generative Structural Theory v1.142 — Shortest Three-Step Connections in Example P

Koji Okino
preprint en

Abstract

Can one minimally strongly connected directed graph be transformed into another if each step may delete at most two edges? For the two leaf lifts \(W\) and \(W′\) in Example P, the answer depends on the direction. From \(W\) to \(W′\), the shortest connection takes exactly three steps. From \(W′\) to \(W\), no connection exists under the same rules. Both graphs have the same 21 vertices. Every intermediate graph must be minimally strongly connected on those vertices and may use only edges from the union of \(W\) and \(W′\). Each step may add any edges from that union. Version 1.141 ruled out a two-step connection from \(W\) to \(W′\). This preprint constructs two three-step connections. They have different first intermediate states, \(W₁\) and \(W₂\), and share the same second intermediate state, \(Y\). Each route deletes one edge in the first step, two in the second, and two in the third. The proof of minimality for \(Y\) uses a general lemma on joining two minimally strongly connected directed graphs at a single shared vertex. A fixed-instance check over all 21 minimally strongly connected spanning subgraphs of the union shows that these are the only two shortest connections. It also establishes the reverse-direction result: no admissible first step leads from \(W′\) to a distinct state. The verification appendix includes the input from v1.141, the check program, and its recorded output for offline reproduction.

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