Publication date
January 1998
DOI Publisher
Academic Press. ISSN
0195-6698 Citation count (estimate)
3Abstract
AbstractWe classify distance-regular graphs that are isometrically embeddable into halved cube graphs
AbstractWe classify distance-regular graphs that are isometrically embeddable into halved cube graphs
AbstractLet Γ denote a d-bounded distance-regular graph with diameter d⩾2. A regular strongly closed...
AbstractIt is shown that for any distance-regular graph Γ with c2 = 2, c3 = 3, and a2 = 2a1 (a1 ≠ 2)...
AbstractLet Γ be a distance-regular graph without induced subgraphsK2,1,1andr=max {j∣ (cj,aj,bj)= (c...
AbstractWe classify distance-regular graphs that are isometrically embeddable into halved cube graph...
AbstractWe examine the class of distance regular graphs which can be embedded in a cube. We show tha...
Let G be a bipartite distance-regular graph with bipartition V(G) = X ∪ Y. Let V(G′) = X and, for x ...
AbstractWe examine the class of distance regular graphs which can be embedded in a cube. We show tha...
AbstractGraphs that can be isometrically embedded into the metric space l1 are called l1-graphs. Hal...
AbstractWe fill in the details of the algorithm sketched in [6] and determine its complexity. As a p...
Let G be a bipartite distance-regular graph with bipartition V(G) = X ∪ Y. Let V(G′) = X and, for x ...
AbstractWe show that the following distance-regular graphs are uniquely determined by their intersec...
AbstractThe Hamming graph H(d,q) satisfies the following conditions: (i)For any pair (u,v) of vertic...
AbstractChatrand et al. [Graph similarity and distance in graphs, Aequationes Math. 55 (1998) 129–14...
AbstractDistance regular graphs fall into three families: primitive, antipodal, and bipartite. Each ...
AbstractDistance-regular graphs which have the same parameters as the Hamming scheme H(n, q) are cla...
AbstractLet Γ denote a d-bounded distance-regular graph with diameter d⩾2. A regular strongly closed...
AbstractIt is shown that for any distance-regular graph Γ with c2 = 2, c3 = 3, and a2 = 2a1 (a1 ≠ 2)...
AbstractLet Γ be a distance-regular graph without induced subgraphsK2,1,1andr=max {j∣ (cj,aj,bj)= (c...
AbstractWe classify distance-regular graphs that are isometrically embeddable into halved cube graph...
AbstractWe examine the class of distance regular graphs which can be embedded in a cube. We show tha...
Let G be a bipartite distance-regular graph with bipartition V(G) = X ∪ Y. Let V(G′) = X and, for x ...
AbstractWe examine the class of distance regular graphs which can be embedded in a cube. We show tha...
AbstractGraphs that can be isometrically embedded into the metric space l1 are called l1-graphs. Hal...
AbstractWe fill in the details of the algorithm sketched in [6] and determine its complexity. As a p...
Let G be a bipartite distance-regular graph with bipartition V(G) = X ∪ Y. Let V(G′) = X and, for x ...
AbstractWe show that the following distance-regular graphs are uniquely determined by their intersec...
AbstractThe Hamming graph H(d,q) satisfies the following conditions: (i)For any pair (u,v) of vertic...
AbstractChatrand et al. [Graph similarity and distance in graphs, Aequationes Math. 55 (1998) 129–14...
AbstractDistance regular graphs fall into three families: primitive, antipodal, and bipartite. Each ...
AbstractDistance-regular graphs which have the same parameters as the Hamming scheme H(n, q) are cla...
AbstractLet Γ denote a d-bounded distance-regular graph with diameter d⩾2. A regular strongly closed...
AbstractIt is shown that for any distance-regular graph Γ with c2 = 2, c3 = 3, and a2 = 2a1 (a1 ≠ 2)...
AbstractLet Γ be a distance-regular graph without induced subgraphsK2,1,1andr=max {j∣ (cj,aj,bj)= (c...
Add to ORKG