The graph Quad(n, q) has as its vertices all of the quadratic forms on a given vector space of dimension n over the field of q elements, with two vertices being adjacent if the rank of their difference is 1 or 2. The classification of the maximal cliques of Quad(n, q), for q odd, is herein completed
AbstractLet ƒ(n, p, q) be the maximum possible number of q-cliques among all graphs on n nodes with ...
Arranging an n-vertex graph as the standard simplex in R , we identify graph cliques with simplex ...
A potential maximal clique of a graph is a vertex set that induces a maximal clique in some minimal ...
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 graphQuad(n,q) has as its vertices all of the quadratic forms on a given vector space of...
Let V denote an n-dimensional vector space over the field of q elements. Associated with V is a grap...
Let V denote a d-dimensional vector space over Fq. Associated to V is a distance-regular graph Quad(...
AbstractThe graphQuad(n,q) has as its vertices all of the quadratic forms on a given vector space of...
AbstractThe graph Quad(n, q) has as its vertices all of the quadratic forms on a given vector space ...
Let V denote a d-dimensional vector space over Fq. Associated to V is a distance-regular graph Quad(...
Let V be an n-dimensional vector space over GF(q). Define a graph Quad as follows: The vertices of Q...
INTRODUCTION Let G = (V; E) be an undirected graph, where V = f1; \Delta \Delta \Delta ; ng is the ...
AbstractLet ƒ(n, p, q) be the maximum possible number of q-cliques among all graphs on n nodes with ...
Arranging an n-vertex graph as the standard simplex in R , we identify graph cliques with simplex ...
A potential maximal clique of a graph is a vertex set that induces a maximal clique in some minimal ...
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 graphQuad(n,q) has as its vertices all of the quadratic forms on a given vector space of...
Let V denote an n-dimensional vector space over the field of q elements. Associated with V is a grap...
Let V denote a d-dimensional vector space over Fq. Associated to V is a distance-regular graph Quad(...
AbstractThe graphQuad(n,q) has as its vertices all of the quadratic forms on a given vector space of...
AbstractThe graph Quad(n, q) has as its vertices all of the quadratic forms on a given vector space ...
Let V denote a d-dimensional vector space over Fq. Associated to V is a distance-regular graph Quad(...
Let V be an n-dimensional vector space over GF(q). Define a graph Quad as follows: The vertices of Q...
INTRODUCTION Let G = (V; E) be an undirected graph, where V = f1; \Delta \Delta \Delta ; ng is the ...
AbstractLet ƒ(n, p, q) be the maximum possible number of q-cliques among all graphs on n nodes with ...
Arranging an n-vertex graph as the standard simplex in R , we identify graph cliques with simplex ...
A potential maximal clique of a graph is a vertex set that induces a maximal clique in some minimal ...
DOI
Add to ORKG