AbstractDistance-regular graphs which have the same parameters as the Hamming scheme H(n, q) are classified. If q ≠ 4, H(n, q) is the only such graph. If q = 4, there are precisely [n2] (isomorphism classes of) such graphs other than H(n, q)
We show that the Hamming graph H(3; q) with diameter three is uniquely determined by its spectrum fo...
AbstractGrassmann graphs and Johnson graphs are graphs in which the neighbor of no vertex contains 3...
In this work we present the study we did in Graph Theory. In the firsts chapteres of the tesis we st...
AbstractIt is shown that for any distance-regular graph Γ with c2 = 2, c3 = 3, and a2 = 2a1 (a1 ≠ 2)...
AbstractIt is shown that for any distance-regular graph Γ with c2 = 2, c3 = 3, and a2 = 2a1 (a1 ≠ 2)...
AbstractWe shall prove a result about local structures of distance-regular graphs with c2 = 2, c3 = ...
AbstractLet G(n, k) denote the graph of the Johnson Scheme J(n, k), i.e., the graph whose vertices a...
If n ⩾ 2d ⩾ 6 and q ⩾ 4, the distance-regular graphs Hq (n, d) (with d × n matrices over GF(q) as ve...
AbstractLet G(n, k) denote the graph of the Johnson Scheme J(n, k), i.e., the graph whose vertices a...
AbstractThe Hamming graph H(d,q) satisfies the following conditions: (i)For any pair (u,v) of vertic...
AbstractThe Hamming graph H(d,q) satisfies the following conditions: (i)For any pair (u,v) of vertic...
AbstractIn this note, we settle a problem of N. Biggs [4, p.80] by showing that for each k, no dista...
AbstractWe classify distance-regular graphs that are isometrically embeddable into halved cube graph...
AbstractWe give a classification of graphs by two parameters s and t such that a graph is regular if...
AbstractLet Γ denote a distance-regular graph with classical parameters (d, b, α, β). Suppose that t...
We show that the Hamming graph H(3; q) with diameter three is uniquely determined by its spectrum fo...
AbstractGrassmann graphs and Johnson graphs are graphs in which the neighbor of no vertex contains 3...
In this work we present the study we did in Graph Theory. In the firsts chapteres of the tesis we st...
AbstractIt is shown that for any distance-regular graph Γ with c2 = 2, c3 = 3, and a2 = 2a1 (a1 ≠ 2)...
AbstractIt is shown that for any distance-regular graph Γ with c2 = 2, c3 = 3, and a2 = 2a1 (a1 ≠ 2)...
AbstractWe shall prove a result about local structures of distance-regular graphs with c2 = 2, c3 = ...
AbstractLet G(n, k) denote the graph of the Johnson Scheme J(n, k), i.e., the graph whose vertices a...
If n ⩾ 2d ⩾ 6 and q ⩾ 4, the distance-regular graphs Hq (n, d) (with d × n matrices over GF(q) as ve...
AbstractLet G(n, k) denote the graph of the Johnson Scheme J(n, k), i.e., the graph whose vertices a...
AbstractThe Hamming graph H(d,q) satisfies the following conditions: (i)For any pair (u,v) of vertic...
AbstractThe Hamming graph H(d,q) satisfies the following conditions: (i)For any pair (u,v) of vertic...
AbstractIn this note, we settle a problem of N. Biggs [4, p.80] by showing that for each k, no dista...
AbstractWe classify distance-regular graphs that are isometrically embeddable into halved cube graph...
AbstractWe give a classification of graphs by two parameters s and t such that a graph is regular if...
AbstractLet Γ denote a distance-regular graph with classical parameters (d, b, α, β). Suppose that t...
We show that the Hamming graph H(3; q) with diameter three is uniquely determined by its spectrum fo...
AbstractGrassmann graphs and Johnson graphs are graphs in which the neighbor of no vertex contains 3...
In this work we present the study we did in Graph Theory. In the firsts chapteres of the tesis we st...
DOI
Add to ORKG