scientific article; zbMATH DE number 4110716

From MaRDI portal
Publication:3834071





[For the entire collection see Zbl 0655.00008.] This long and virtually self-contained paper does more than enumerate the k-valent distance-transitive graphs for \(8\leq k\leq 13\) as claimed. Basically, the authors sharpen the algorithm used by \textit{I. A. Faradžev} and themselves [Eur. J. Comb. 7, 303-319 (1986; Zbl 0608.05041)] to do this job for \(k=5,6,7\). A leisurely, well-documented introduction motivates the present work, setting it in its historial and theoretical context; the thorough list of references contains 67 items about distance-transitive graphs and/or their group-theoretical prerequisites. The authors include the following noteworthy conjecture: Let \(\Gamma\) be a distance-transitive graph with (conventional) intersection numbers \((c_ i,a_ i,b_ i)\). Let r and t be largest integers such that \((1,a_ i,b_ i)=(1,a_{r-1},b_{r-1})\) for \(1\leq i\leq r-1\), and for some \(s\geq 1\), \((c_{s+i},a_{s+i},b_{s+i})=(c_{s+t},a_{s+t},b_{s+t})\) for \(0\leq i\leq t\). Then \(t\leq r\).











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3834071)