Quasirecognition by prime graph of \(^2D p(3)\) where \(p=2^n+1\geq 5\) is a prime.
From MaRDI portal
(Redirected from Quasirecognition by prime graph of ^2D_p(3) where p=2ⁿ+1 5 is a prime.)
Quasirecognition by prime graph of \(^2D p(3)\) where \(p=2^n+1\geq 5\) is a prime.
Quasirecognition by prime graph of \(^2D p(3)\) where \(p=2^n+1\geq 5\) is a prime.
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.
