AbstractT. A. Dowling (J. Combin. Theory6 (1969), 251–263) proved the uniqueness of the graphs G(n, k) of the Johnson schemes for n > 2k(k − 1) + 4. We improve this result by showing the uniqueness of G(n, k) for n > 4k
AbstractDistance-regular graphs which have the same parameters as the Hamming scheme H(n, q) are cla...
AbstractIn the first part we examine bipartite graphs with a unique regular factor and present upper...
AbstractA graph is said to be chromatically unique (or χ-unique) if it is uniquely determined by its...
AbstractT. A. Dowling (J. Combin. Theory6 (1969), 251–263) proved the uniqueness of the graphs G(n, ...
AbstractLet G(n, k) denote the graph of the Johnson Scheme J(n, k), i.e., the graph whose vertices a...
AbstractWe use the classical Root Systems to show the Johnson graph J(d, r) (2 ⩽ 2d ⩽ r < ∞) is the ...
AbstractThe graphs of the Johnson schemes G(3k, k) and G(3k + 1, k) are characterized by their param...
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...
AbstractIn this note, it is shown that all graphs Fn,k for odd integer n ⩾ 5, and integer k ⩾ 1 are ...
Abstract: Let n and k be fixed positive integers. The Johnson Graph G(n,k),also known as the slice ...
AbstractLet W(n, m) denote the graph of order n obtained from the wheel Wn be deleting all but m con...
AbstractLet K(p, q), p ⩽ q, denote the complete bipartite graph in which the two partite sets consis...
AbstractLet σk(G) denote the number of cycles of length k in a graph G. In this paper, we first prov...
AbstractLetGbe a uniquely hamiltonian graph onnvertices. We show thatGhas a vertex of degree at most...
AbstractDistance-regular graphs which have the same parameters as the Hamming scheme H(n, q) are cla...
AbstractIn the first part we examine bipartite graphs with a unique regular factor and present upper...
AbstractA graph is said to be chromatically unique (or χ-unique) if it is uniquely determined by its...
AbstractT. A. Dowling (J. Combin. Theory6 (1969), 251–263) proved the uniqueness of the graphs G(n, ...
AbstractLet G(n, k) denote the graph of the Johnson Scheme J(n, k), i.e., the graph whose vertices a...
AbstractWe use the classical Root Systems to show the Johnson graph J(d, r) (2 ⩽ 2d ⩽ r < ∞) is the ...
AbstractThe graphs of the Johnson schemes G(3k, k) and G(3k + 1, k) are characterized by their param...
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...
AbstractIn this note, it is shown that all graphs Fn,k for odd integer n ⩾ 5, and integer k ⩾ 1 are ...
Abstract: Let n and k be fixed positive integers. The Johnson Graph G(n,k),also known as the slice ...
AbstractLet W(n, m) denote the graph of order n obtained from the wheel Wn be deleting all but m con...
AbstractLet K(p, q), p ⩽ q, denote the complete bipartite graph in which the two partite sets consis...
AbstractLet σk(G) denote the number of cycles of length k in a graph G. In this paper, we first prov...
AbstractLetGbe a uniquely hamiltonian graph onnvertices. We show thatGhas a vertex of degree at most...
AbstractDistance-regular graphs which have the same parameters as the Hamming scheme H(n, q) are cla...
AbstractIn the first part we examine bipartite graphs with a unique regular factor and present upper...
AbstractA graph is said to be chromatically unique (or χ-unique) if it is uniquely determined by its...
DOI
Add to ORKG