Distance-regular graphs with girth 3 or 4: I (Q1073051): Difference between revisions

Some relationships are obtained between the intersection numbers of a distance-regular graph of girth 3 or 4 that contains a cycle \(\{u_ 1,u_ 2,u_ 3,u_ 4\}\) with \(\partial (u_ 1,u_ 3)=\partial (u_ 2,u_ 4)=2\). These imply that the diameter d, valency k and intersection numbers \(a_ 1\) and \(c_ d\) satisfy \(d\leq (k+c_ d)/(a_ 1+2)\). Some results are also obtained about the subgraphs induced by vertex neighbourhoods in distance-regular graphs that do not contain cycles of the above type.