AbstractWe prove that when q is any odd prime power, the distance-2 graph on the set of vertices at maximal distance D from any fixed vertex of the Hemmeter graph HemD(q) is isomorphic to the graph QuadD-1(q) of quadratic forms on FqD-1
AbstractIn this paper we study a distance-regular graph Γ of diameter d≥4 such that for any given pa...
<p>A connected graph is said to be of QE class if it admits a quadratic embedding in a Hilbert spac...
AbstractLet Γ denote a distance-regular graph with diameter d⩾3. Let E, F denote nontrivial primitiv...
Let V denote a d-dimensional vector space over Fq. Associated to V is a distance-regular graph Quad(...
We consider Euclidean distance graphs with vertex set Q2 or Z2 and address the possibility or imposs...
AbstractLet Γ denote a bipartite distance-regular graph with diameter D≥3. Fix any vertex x and let ...
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 ...
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...
Abstract. Suppose G is a connected, k-regular graph such that Spec\u85G Spec\u85G where G is a d...
AbstractWe relate the graph isomorphism problem to the classical problem of equivalence of integer q...
AbstractLet Γ denote a near polygon distance-regular graph with diameter d≥3, valency k and intersec...
The QE constant of a finite connected graph G, denoted by QEC(G), is by definition the maximum of th...
AbstractIn this paper we study a distance-regular graph Γ of diameter d≥4 such that for any given pa...
<p>A connected graph is said to be of QE class if it admits a quadratic embedding in a Hilbert spac...
AbstractLet Γ denote a distance-regular graph with diameter d⩾3. Let E, F denote nontrivial primitiv...
Let V denote a d-dimensional vector space over Fq. Associated to V is a distance-regular graph Quad(...
We consider Euclidean distance graphs with vertex set Q2 or Z2 and address the possibility or imposs...
AbstractLet Γ denote a bipartite distance-regular graph with diameter D≥3. Fix any vertex x and let ...
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 ...
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...
Abstract. Suppose G is a connected, k-regular graph such that Spec\u85G Spec\u85G where G is a d...
AbstractWe relate the graph isomorphism problem to the classical problem of equivalence of integer q...
AbstractLet Γ denote a near polygon distance-regular graph with diameter d≥3, valency k and intersec...
The QE constant of a finite connected graph G, denoted by QEC(G), is by definition the maximum of th...
AbstractIn this paper we study a distance-regular graph Γ of diameter d≥4 such that for any given pa...
<p>A connected graph is said to be of QE class if it admits a quadratic embedding in a Hilbert spac...
AbstractLet Γ denote a distance-regular graph with diameter d⩾3. Let E, F denote nontrivial primitiv...
DOI
Add to ORKG