Let V denote a d-dimensional vector space over Fq. Associated to V is a distance-regular graph Quad(d, q), the vertex set of which consists of all quadratic forms on V and the edges (x, y) of which are defined by the property rk(x - y) = 1 or 2. In [8] it is shown that there are three distinguished classes of maximal cliques of respective sizes qd, qd and q3, and that all remaining maximal cliques M satisfy ❘M❘ ⩽ q2 + q + 2. In the present work, we obtain a strong refinement of this result when q⩾ 5 is odd, providing a complete classification of all maximal cliques of size at least q + 4
INTRODUCTION Let G = (V; E) be an undirected graph, where V = f1; \Delta \Delta \Delta ; ng is the ...
Arranging an n-vertex graph as the standard simplex in R , we identify graph cliques with simplex ...
AbstractIn this paper we study the maximalt-cliques of theq-analog of the Johnson GraphJq(n, k)with ...
Let V denote a d-dimensional vector space over Fq. Associated to V is a distance-regular graph Quad(...
Let V denote an n-dimensional vector space over the field of q elements. Associated with V is a grap...
The graph Quad(n, q) has as its vertices all of the quadratic forms on a given vector space of dimen...
The graph Quad(n, q) has as its vertices all of the quadratic forms on a given vector space of dimen...
The graph Quad(n, q) has as its vertices all of the quadratic forms on a given vector space of dimen...
The graph Quad(n, q) has as its vertices all of the quadratic forms on a given vector space of dimen...
AbstractThe graph Quad(n, q) has as its vertices all of the quadratic forms on a given vector space ...
AbstractThe graph Quad(n, q) has as its vertices all of the quadratic forms on a given vector space ...
AbstractThe graphQuad(n,q) has as its vertices all of the quadratic forms on a given vector space of...
Let V be an n-dimensional vector space over GF(q). Define a graph Quad as follows: The vertices of Q...
AbstractThe graphQuad(n,q) has as its vertices all of the quadratic forms on a given vector space of...
AbstractWe prove that when q is any odd prime power, the distance-2 graph on the set of vertices at ...
INTRODUCTION Let G = (V; E) be an undirected graph, where V = f1; \Delta \Delta \Delta ; ng is the ...
Arranging an n-vertex graph as the standard simplex in R , we identify graph cliques with simplex ...
AbstractIn this paper we study the maximalt-cliques of theq-analog of the Johnson GraphJq(n, k)with ...
Let V denote a d-dimensional vector space over Fq. Associated to V is a distance-regular graph Quad(...
Let V denote an n-dimensional vector space over the field of q elements. Associated with V is a grap...
The graph Quad(n, q) has as its vertices all of the quadratic forms on a given vector space of dimen...
The graph Quad(n, q) has as its vertices all of the quadratic forms on a given vector space of dimen...
The graph Quad(n, q) has as its vertices all of the quadratic forms on a given vector space of dimen...
The graph Quad(n, q) has as its vertices all of the quadratic forms on a given vector space of dimen...
AbstractThe graph Quad(n, q) has as its vertices all of the quadratic forms on a given vector space ...
AbstractThe graph Quad(n, q) has as its vertices all of the quadratic forms on a given vector space ...
AbstractThe graphQuad(n,q) has as its vertices all of the quadratic forms on a given vector space of...
Let V be an n-dimensional vector space over GF(q). Define a graph Quad as follows: The vertices of Q...
AbstractThe graphQuad(n,q) has as its vertices all of the quadratic forms on a given vector space of...
AbstractWe prove that when q is any odd prime power, the distance-2 graph on the set of vertices at ...
INTRODUCTION Let G = (V; E) be an undirected graph, where V = f1; \Delta \Delta \Delta ; ng is the ...
Arranging an n-vertex graph as the standard simplex in R , we identify graph cliques with simplex ...
AbstractIn this paper we study the maximalt-cliques of theq-analog of the Johnson GraphJq(n, k)with ...