AbstractThe graphs of the Johnson schemes G(3k, k) and G(3k + 1, k) are characterized by their parameters. In particular this finishes the characterization of the tetrahedral graphs G(n, 3)
Let v \u3e k \u3e i be non-negative integers. The generalized Johnson graph, J(v,k,i), is the graph ...
AbstractA unified approach to a variety of graph-theoretic problems is introduced. The k-closure Ck(...
AbstractLet G= (V, E) be a connected graph endowed with the standard graph-metric dGand in which lon...
AbstractLet G(n, k) denote the graph of the Johnson Scheme J(n, k), i.e., the graph whose vertices a...
AbstractIn this note, we settle a problem of N. Biggs [4, p.80] by showing that for each k, no dista...
AbstractT. A. Dowling (J. Combin. Theory6 (1969), 251–263) proved the uniqueness of the graphs G(n, ...
Abstract: Let n and k be fixed positive integers. The Johnson Graph G(n,k),also known as the slice ...
AbstractLet G(n, k) denote the graph of the Johnson Scheme J(n, k), i.e., the graph whose vertices a...
AbstractGrassmann graphs and Johnson graphs are graphs in which the neighbor of no vertex contains 3...
A set of vertices SS in a graph GG is a resolving set for GG if, for any two vertices u,vu,v, ther...
AbstractBose and Laskar introduced the tetrahedral graph G, whose points may be identified with the ...
AbstractDistance-regular graphs which have the same parameters as the Hamming scheme H(n, q) are cla...
AbstractWe use the classical Root Systems to show the Johnson graph J(d, r) (2 ⩽ 2d ⩽ r < ∞) is the ...
AbstractWe show that the following distance-regular graphs are uniquely determined by their intersec...
It has been recently proved that the connectivity of distance regular graphs is the degree of the ...
Let v \u3e k \u3e i be non-negative integers. The generalized Johnson graph, J(v,k,i), is the graph ...
AbstractA unified approach to a variety of graph-theoretic problems is introduced. The k-closure Ck(...
AbstractLet G= (V, E) be a connected graph endowed with the standard graph-metric dGand in which lon...
AbstractLet G(n, k) denote the graph of the Johnson Scheme J(n, k), i.e., the graph whose vertices a...
AbstractIn this note, we settle a problem of N. Biggs [4, p.80] by showing that for each k, no dista...
AbstractT. A. Dowling (J. Combin. Theory6 (1969), 251–263) proved the uniqueness of the graphs G(n, ...
Abstract: Let n and k be fixed positive integers. The Johnson Graph G(n,k),also known as the slice ...
AbstractLet G(n, k) denote the graph of the Johnson Scheme J(n, k), i.e., the graph whose vertices a...
AbstractGrassmann graphs and Johnson graphs are graphs in which the neighbor of no vertex contains 3...
A set of vertices SS in a graph GG is a resolving set for GG if, for any two vertices u,vu,v, ther...
AbstractBose and Laskar introduced the tetrahedral graph G, whose points may be identified with the ...
AbstractDistance-regular graphs which have the same parameters as the Hamming scheme H(n, q) are cla...
AbstractWe use the classical Root Systems to show the Johnson graph J(d, r) (2 ⩽ 2d ⩽ r < ∞) is the ...
AbstractWe show that the following distance-regular graphs are uniquely determined by their intersec...
It has been recently proved that the connectivity of distance regular graphs is the degree of the ...
Let v \u3e k \u3e i be non-negative integers. The generalized Johnson graph, J(v,k,i), is the graph ...
AbstractA unified approach to a variety of graph-theoretic problems is introduced. The k-closure Ck(...
AbstractLet G= (V, E) be a connected graph endowed with the standard graph-metric dGand in which lon...
DOI
Add to ORKG