论文信息 - Distance-regular graphs and (s, c, a, k)-graphs

Distance-regular graphs and (s, c, a, k)-graphs

A diameter-bound theorem for a class of distance-regular graphs which includes all those with even girth is presented. A new class of graphs, called (s, c, a, k)-graphs, is introduced, which are conjectured to contain enough of the local structure of finite distance-regular graphs for them all to be finite. It is proved that they are finite and a bound on the diameter is given in the case a ≤ c.

Paul M. Terwilliger

[1] H. D. Macpherson. Infinite distance transitive graphs of finite valency , 1982, Comb..

[2] N. Biggs. Algebraic Graph Theory: The multiplicative expansion , 1974 .

[3] Arjeh M. Cohen,et al. A synopsis of known distance-regular graphs with large diameters , 1981 .

[4] Derek H. Smith. On Tetravalent Graphs , 1973 .

[5] Martyn Mulder. (0, Λ)-graphs and N-cubes , 1979, Discret. Math..

[6] Norman Biggs,et al. On Trivalent Graphs , 1971 .

[7] Paul M. Terwilliger. The diameter of bipartite distance-regular graphs , 1982, J. Comb. Theory, Ser. B.

[8] Richard Weiss,et al. The nonexistence of 8-transitive graphs , 1981, Comb..

[9] Derek H. Smith. Distance-Transitive Graphs of Valency Four , 1974 .