English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

It is known that, up to isomorphism, there is a unique distance-regular graph$\Delta$ with intersection array {32,27;1,12} (equivalently, $\Delta$ is theunique strongly regular graph with parameters (105,32,4,12)). Here weinvestigate the distance-regular antipodal covers of $\Delta$. We show that, upto isomorphism, there is just one distance-regular antipodal triple cover of$\Delta$ (a graph $\hat\Delta$ discovered by the author over twenty years ago),proving that there is a unique distance-regular graph with intersection array{32,27,8,1;1,4,27,32}. In the process, we confirm an unpublished result ofSteve Linton that there is no distance-regular antipodal double cover of$\Delta$, and so no distance-regular graph with intersection array{32,27,6,1;1,6,27,32}. We also show there is no distance-regular antipodal4-cover of $\Delta$, and so no distance-regular graph with intersection array{32,27,9,1;1,3,27,32}, and that there is no distance-regular antipodal 6-coverof $\Delta$ that is a double cover of $\hat\Delta$.

The uniqueness of a distance-regular graph with intersection array {32,27,8,1;1,4,27,32} and related results