Skip to content
Preprint

Diameter and radius of an additive-multiplicative graph

Sep 2026 · 0 citations · 12 references
Mathematics

Abstract

Let $G$ be the graph on the positive integers in which distinct vertices are adjacent if they differ by one or their quotient in one order is prime. We prove that $6\leq\operatorname{diam}(G)\leq7$ and $4\leq\operatorname{rad}(G)\leq5$. Under Dickson's conjecture for two linear forms, we prove that $\operatorname{diam}(G)=6$ and $\operatorname{rad}(G)=4$.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.