On strictly Deza graphs with parameters (n,k,k-1,a)

Abstract

A nonempty k-regular graph on n vertices is called a Deza graph if there exist constants b and a (b ≥ a) such that any pair of distinct vertices of has precisely either b or a common neighbours. The quantities n, k, b, and a are called the parameters of and are written as the quadruple (n,k,b,a). If a Deza graph has diameter 2 and is not strongly regular, then it is called a strictly Deza graph. In the paper we investigate strictly Deza graphs with parameters (n, k, b, a) , where its quantities satisfy the conditions k = b + 1 and k(k - 1) - a(n - 1)b - a > 1.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…