Local structure of graphs with = = 2, a_ 2=4
Local structure of graphs with \(\lambda= \mu= 2\), \(a 2=4\)
The author studies graphs \(G\) with the following properties: \(\lambda = 2\): For any two adjacent vertices in \(G\), there are exactly two vertices adjacent to both. \(\mu = 2\): For any two vertices at distance 2, there are exactly two vertices adjacent to both. \(a_2 = 4\): For any pair of vertices \(p\), \(q\) of \(G\) at distance 2, there are exactly four vertices adjacent to \(q\) and at distance 2 from \(p\). He proves that the graph induced by the set of neighbors of any vertex in \(G\) is a disjoint union of triangles, hexagons or heptagons. This result implies that there is no distance-regular graph with intersection array (13, 10, 7; 1, 2, 7).
- scientific article; zbMATH DE number 6808067
- On distance-regular graphs with \(c_2 = 2\)
- The impact of 2-neighborhoods on graph structure
- Distance regular graphs in which local subgraphs are strongly regular graphs with the second eigenvalue at most 3
- On local structure of a distance-regular graph of Hamming type
This page was built for publication: Local structure of graphs with \(\lambda= \mu= 2\), \(a_ 2=4\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1906845)
