Generative Structural Theory v1.144 — Shortest Reverse Connections and Deletion Totals in Example P

Does reversing a graph transformation change the minimum number of steps? In Example P, W and W′ are minimally strongly connected directed graphs on the same 21 vertices. Each step may delete at most two directed edges and may add edges between any of the vertices. Every intermediate graph must also be minimally strongly connected. Version 1.143 showed that W can reach W′ in two steps. This preprint shows that the reverse transformation, from W′ to W, requires exactly three. Attaching a directed two-cycle at each of 20 possible vertices gives 20 distinct shortest reverse connections. At each of the four designated attachment vertices, called ports, the resulting connection deletes five edges in total and uses just one edge outside A₀ = W ∪ W′. At each of the other 16 vertices, it deletes six edges in total and uses two distinct edges outside A₀. Both values attained at the ports are optimal over reverse connections of any length. Four edges of W′ are absent from W and must be deleted. Every distinct edge used outside A₀ must also be deleted before reaching W. Fixed-instance results from v1.141 and v1.142 establish that every reverse connection must use at least one such edge. The minimum is therefore five deletions in the reverse direction, compared with four in the forward direction.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24346303
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.144 — Shortest Reverse Connections and Deletion Totals in Example P

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

Generative Structural Theory v1.144 — Shortest Reverse Connections and Deletion Totals in Example P

Koji Okino
preprint en

Abstract

Does reversing a graph transformation change the minimum number of steps? In Example P, W and W′ are minimally strongly connected directed graphs on the same 21 vertices. Each step may delete at most two directed edges and may add edges between any of the vertices. Every intermediate graph must also be minimally strongly connected. Version 1.143 showed that W can reach W′ in two steps. This preprint shows that the reverse transformation, from W′ to W, requires exactly three. Attaching a directed two-cycle at each of 20 possible vertices gives 20 distinct shortest reverse connections. At each of the four designated attachment vertices, called ports, the resulting connection deletes five edges in total and uses just one edge outside A₀ = W ∪ W′. At each of the other 16 vertices, it deletes six edges in total and uses two distinct edges outside A₀. Both values attained at the ports are optimal over reverse connections of any length. Four edges of W′ are absent from W and must be deleted. Every distinct edge used outside A₀ must also be deleted before reaching W. Fixed-instance results from v1.141 and v1.142 establish that every reverse connection must use at least one such edge. The minimum is therefore five deletions in the reverse direction, compared with four in the forward direction.

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