2025/01/10 by Hou Tin Chau, Chau, Hou Tin
Computer Science · Engineering · #05C69 (Primary) 05C35 #05C76 (Secondary) #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2501.05854
openalex publication_date 2025/01/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
For every natural number d, we construct finite d-regular simple graphs that, for every r ≤ d, contain an independent exact r-cover. This answers a question of Gray and Johnson that arose in their study of 2-step transit probabilities. We obtain some divisibility conditions on the order n of graphs that for every r ≤ d contain an independent exact r-cover, and give constructions for d=3, 4, 5, 6 where the order of the graph is minimal (we deduce this minimality from our divisibility conditions). We construct these graphs as common coverings of smaller graphs. We revisit a result of Angluin and Gardiner on finite common coverings of two regular graphs of the same degree, and the result of Gross that regular graphs of even degree are Schreier coset graphs. We combine both results to provide a finite common covering of two regular graphs of the same degree, that uses fewer vertices than the construction of Angluin and Gardiner in some cases.