Metraipolis › archive › dc_46db18acbc20

Diameter and radius of an additive-multiplicative graph — arXiv:2609.39347

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.39347
License (as archived)
CC0-1.0
Archived
2026-10-07T14:19:05.807Z
SHA-256 of the archived text
6248c52ef785ce8b4911d548e3a8d0e0c0726711096fa74e66394ebe11759f93
Stable URL of this page
https://metraipolis.com/documento/dc_46db18acbc20

How to cite

Diameter and radius of an additive-multiplicative graph — arXiv:2609.39347 — arXiv (en), https://arxiv.org/abs/2609.39347 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_46db18acbc20 (Metraipolis archive dc_46db18acbc20, sha256 6248c52ef785ce8b4911d548e3a8d0e0c0726711096fa74e66394ebe11759f93)
BibTeX
@misc{dc46db18acbc20,
  title = {Diameter and radius of an additive-multiplicative graph — arXiv:2609.39347},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.39347},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_46db18acbc20; sha256 6248c52ef785ce8b4911d548e3a8d0e0c0726711096fa74e66394ebe11759f93},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39347. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Number Theory (math.NT).
Pagina del lavoro: https://arxiv.org/abs/2609.39347 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T14:05:16.433Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).