Locally triangular graphs and rectagraphs with symmetry

From MaRDI portal
Publication:2347873




Abstract: Locally triangular graphs are known to be halved graphs of bipartite rectagraphs, which are connected triangle-free graphs in which every 2-arc lies in a unique quadrangle. A graph Gamma is locally rank 3 if there exists GleqmathrmAut(Gamma) such that for each vertex u, the permutation group induced by the vertex stabiliser Gu on the neighbourhood Gamma(u) is transitive of rank 3. One natural place to seek locally rank 3 graphs is among the locally triangular graphs, where every induced neighbourhood graph is isomorphic to a triangular graph Tn. This is because the graph Tn, which has vertex set the 2-subsets of 1,ldots,n and edge set the pairs of 2-subsets intersecting at one point, admits a rank 3 group of automorphisms. In this paper, we classify the locally 4-homogeneous rectagraphs under some additional structural assumptions. We then use this result to classify the connected locally triangular graphs that are also locally rank 3.



Cites work



Describes a project that uses

Uses Software






This page was built for publication: Locally triangular graphs and rectagraphs with symmetry

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