Fault-Robust Radius-Two Triple Coverage with Three Uninstrumented Vertices: A Computer-Assisted Extremal Classification

We study finite simple undirected graphs with exactly three uninstrumented vertices and authenticated reports of one common scalar from every other vertex. Every observer must receive at least three distinct sources within distance two after deletion of any one edge, which permits correction of one arbitrary source substitution. We prove a local critical-edge loss formula and give a protected-path shortening argument, degree-excess multigraph-core reductions, and independent finite verifiers. A complete bounded census of 63 core forms, 119 admissible decorations, and 7,444 expanded simple presentations yields 18 valid presentations on ten vertices in two isomorphism classes. Subject to the mathematical reduction and computational completeness arguments, the connected optimum is n+2 at n=10 and n+3 at other n>=6; in the disconnected-allowed model it is n+2 at n=10 or n>=13 and n+3 at n=6..9,11,12. The paper is a non-peer-reviewed computer-assisted preprint; historical novelty has not been established. AI assistance was used in drafting the manuscript, developing and reviewing computational verification code, and identifying relevant mathematical literature. The named human author assumes responsibility for the submitted manuscript, source code, mathematical claims and publication decisions. AI systems are not listed as authors. AI assistance was used in drafting the manuscript, developing and reviewing computational verification code, and identifying relevant mathematical literature. The named human author assumes responsibility for the submitted manuscript, source code, mathematical claims and publication decisions. AI systems are not listed as authors.

Authors

Publication Details

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

Fault-Robust Radius-Two Triple Coverage with Three Uninstrumented Vertices: A Computer-Assisted Extremal Classification

Ivo Vajc
1 links
Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Theory Research
preprint

Fault-Robust Radius-Two Triple Coverage with Three Uninstrumented Vertices: A Computer-Assisted Extremal Classification

Ivo Vajc
preprint en

Abstract

We study finite simple undirected graphs with exactly three uninstrumented vertices and authenticated reports of one common scalar from every other vertex. Every observer must receive at least three distinct sources within distance two after deletion of any one edge, which permits correction of one arbitrary source substitution. We prove a local critical-edge loss formula and give a protected-path shortening argument, degree-excess multigraph-core reductions, and independent finite verifiers. A complete bounded census of 63 core forms, 119 admissible decorations, and 7,444 expanded simple presentations yields 18 valid presentations on ten vertices in two isomorphism classes. Subject to the mathematical reduction and computational completeness arguments, the connected optimum is n+2 at n=10 and n+3 at other n>=6; in the disconnected-allowed model it is n+2 at n=10 or n>=13 and n+3 at n=6..9,11,12. The paper is a non-peer-reviewed computer-assisted preprint; historical novelty has not been established. AI assistance was used in drafting the manuscript, developing and reviewing computational verification code, and identifying relevant mathematical literature. The named human author assumes responsibility for the submitted manuscript, source code, mathematical claims and publication decisions. AI systems are not listed as authors. AI assistance was used in drafting the manuscript, developing and reviewing computational verification code, and identifying relevant mathematical literature. The named human author assumes responsibility for the submitted manuscript, source code, mathematical claims and publication decisions. AI systems are not listed as authors.

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