Primitive graphs with small exponent and small scrambling index

A connected graph G is primitive provide there is a positive integer k such that for each pair of vertices u and v there is a uv-walk of length k. The smallest of such positive integer k is the exponent of G and is denoted by exp(G). The scrambling index of a primitive graph G, denoted by k(G), is the smallest positive integer k such that for each pair of vertices u and v there is a vertex w such that there is a uw-walk and a vw-walk of length k. By an n-chainring CR(n) we mean a graph obtained from an n-cycle by replacing each edge of the n-cycle by a triangle. By a (q,p)-dory, D(q, p), we mean a graph with vertex set V(D(q, p)) = V(P-q x P-p)boolean OR{w(1), w(2)} and edge set E(D(q, p)) = E(P-q x P-p)boolean OR{w(1)-(u(i), v(1)) : i = 1, 2, ... , q}boolean OR{w(2)-(u(i), v(p),) : i = 1, 2, ... , q}, where P-n is a path on n vertices. We discus the exponent and scrambling index of an n-chainring and (q, p)-dory. We present formulae for exponent and scrambling index in terms of their diameter.