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/

Global: Zendy Plus annual

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

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

A distance-regular graph is called geometric if each its edge belongs to a unique maximal clique on the size of which the Hoffman-Delsarte inequality is satisfied as equality. A geometric classification of distance-regular graphs containing no 4-claws was put forward by S. Bang. In the present paper we refine the description of one class of such graphs. In particular, it is shown that a graph with the intersection array {45, 30, 7; 1, 2, 27} does not exist.

Distance-regular graph with the intersection array {45, 30, 7; 1, 2, 27} does not exist