arXiv (All)
open access
Diameter and radius of an additive-multiplicative graph
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On prime coprime graphs of certain finite groups#1116117
- Vizing's theorem for signed multigraphs#1117820
- Primes with Restricted-Digit Differences#987858
- Counterexamples to a conjecture of Kamenetsky on OEIS A173419#1076169
- Prime-power Diophantine tuples#926368
Record · ID 1144314
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive