Distance-regular graphs with girth 3 or 4: I
From MaRDI portal
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.
Recommendations
Cites work
- A generalization of Moore graphs of diameter two
- Automorphic graphs and the Krein condition
- Distance-regular graphs and (s,c,a,k)-graphs
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3758369 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- Locally petersen graphs
- There are only finitely many finite distance-transitive graphs of given valency greater than two
Cited in
(31)- A class of distance-regular graphs that are \(\phi\)-polynomial
- Distance-regular digraphs of girth 4
- On distance-transitive graphs and involutions
- On distance-biregular graphs of girth divisible by four
- Some inequalities in distance-regular graphs
- Intersection numbers of bipartite distance-regular graphs
- On regular Terwilliger graphs with =2
- 1-homogeneous graphs with cocktail party \({\mu}\)-graphs
- Dual polar spaces as extremal distance-regular graphs.
- Root systems and the Johnson and Hamming graphs
- Linear groups and distance-transitive graphs
- On distance-regular graphs with \(k_ i= k_ j\). II
- A characterization of Johnson and Hamming graphs and proof of Babai's conjecture
- Intersection diagrams of distance-biregular graphs
- Distance-regular digraphs of girth 4 over an extension ring of Z/4Z
- A unified view of inequalities for distance-regular graphs. I
- Some properties of a class distance-4-graphs
- scientific article; zbMATH DE number 3981222 (Why is no real title available?)
- DISTANCE-REGULAR DIGRAPHS OF GIRTH 6
- Exceptional graphs with smallest eigenvalue -2 and related problems
- Distance-regular graphs with an eigenvalue \(-k < \theta \leq 2-k\)
- ON DISTANCE-REGULAR GRAPHS WITH c4=1 AND a1≠a2
- The Terwilliger polynomial of a \(Q\)-polynomial distance-regular graph and its application to pseudo-partition graphs
- CIRCUIT CHASING TECHNIQUE FOR A DISTANCE-REGULAR GRAPH WITH c 2r+1=1
- scientific article; zbMATH DE number 2192091 (Why is no real title available?)
- The distance-regular graphs such that all of its second largest local eigenvalues are at most one
- On distance-regular graphs with smallest eigenvalue at least \(- m\)
- Towards a classification of 1-homogeneous distance-regular graphs with positive intersection number a₁
- A characterization of one class of graphs without 3-claws
- The girth of a directed distance-regular graph
- A characterization of the Hamming graph by strongly closed subgraphs
This page was built for publication: Distance-regular graphs with girth 3 or 4: I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1073051)