Reproduce “Classifying K-Geodetic Graphs Via Combinatorial Designs and Distance-regularity” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Carlos E. Frasser

The authors derive an exact test for K-geodeticity in distance-regular graphs. For vertices at distance i, the number of shortest paths is the product c1 through ci, so checking whether each product is at most K requires only d inequalities. The Heawood graph has counts 1, 1, and 3, making it trigeodetic; this does not classify all graphs.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.