AbstractIn this note, we settle a problem of N. Biggs [4, p.80] by showing that for each k, no distance regular graph non-isomorphic to the odd graph Ok can have the same parameters as Ok. A related characterization of certain graphs associated with the Johnson scheme J(2k+1, k) is also given
In this work we present the study we did in Graph Theory. In the firsts chapteres of the tesis we st...
2010 Mathematics Subject Classification: 05E30, 05C50;distance-regular graphs;generalized odd graphs...
In this work we present the study we did in Graph Theory. In the firsts chapteres of the tesis we st...
AbstractLet G(n, k) denote the graph of the Johnson Scheme J(n, k), i.e., the graph whose vertices a...
AbstractLet G(n, k) denote the graph of the Johnson Scheme J(n, k), i.e., the graph whose vertices a...
AbstractThe graphs of the Johnson schemes G(3k, k) and G(3k + 1, k) are characterized by their param...
AbstractDistance-regular graphs which have the same parameters as the Hamming scheme H(n, q) are cla...
AbstractT. A. Dowling (J. Combin. Theory6 (1969), 251–263) proved the uniqueness of the graphs G(n, ...
Abstract. Suppose G is a connected, k-regular graph such that Spec\u85G Spec\u85G where G is a d...
AbstractGrassmann graphs and Johnson graphs are graphs in which the neighbor of no vertex contains 3...
AbstractWe use the classical Root Systems to show the Johnson graph J(d, r) (2 ⩽ 2d ⩽ r < ∞) is the ...
AbstractIf G is a graph with k ⩾ 1 odd cycle lengths then each block of G is either K2k+2 or contain...
AbstractWe show that any connected regular graph with d+1 distinct eigenvalues and odd-girth 2d+1 is...
AbstractWe show that any connected regular graph with d+1 distinct eigenvalues and odd-girth 2d+1 is...
We show that any connected regular graph with d + 1 distinct eigenvalues and odd-girth 2d + 1 is dis...
In this work we present the study we did in Graph Theory. In the firsts chapteres of the tesis we st...
2010 Mathematics Subject Classification: 05E30, 05C50;distance-regular graphs;generalized odd graphs...
In this work we present the study we did in Graph Theory. In the firsts chapteres of the tesis we st...
AbstractLet G(n, k) denote the graph of the Johnson Scheme J(n, k), i.e., the graph whose vertices a...
AbstractLet G(n, k) denote the graph of the Johnson Scheme J(n, k), i.e., the graph whose vertices a...
AbstractThe graphs of the Johnson schemes G(3k, k) and G(3k + 1, k) are characterized by their param...
AbstractDistance-regular graphs which have the same parameters as the Hamming scheme H(n, q) are cla...
AbstractT. A. Dowling (J. Combin. Theory6 (1969), 251–263) proved the uniqueness of the graphs G(n, ...
Abstract. Suppose G is a connected, k-regular graph such that Spec\u85G Spec\u85G where G is a d...
AbstractGrassmann graphs and Johnson graphs are graphs in which the neighbor of no vertex contains 3...
AbstractWe use the classical Root Systems to show the Johnson graph J(d, r) (2 ⩽ 2d ⩽ r < ∞) is the ...
AbstractIf G is a graph with k ⩾ 1 odd cycle lengths then each block of G is either K2k+2 or contain...
AbstractWe show that any connected regular graph with d+1 distinct eigenvalues and odd-girth 2d+1 is...
AbstractWe show that any connected regular graph with d+1 distinct eigenvalues and odd-girth 2d+1 is...
We show that any connected regular graph with d + 1 distinct eigenvalues and odd-girth 2d + 1 is dis...
In this work we present the study we did in Graph Theory. In the firsts chapteres of the tesis we st...
2010 Mathematics Subject Classification: 05E30, 05C50;distance-regular graphs;generalized odd graphs...
In this work we present the study we did in Graph Theory. In the firsts chapteres of the tesis we st...