On weakly half-transitive graphs (Q2569322)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On weakly half-transitive graphs
scientific article

    Statements

    On weakly half-transitive graphs (English)
    0 references
    0 references
    0 references
    18 October 2005
    0 references
    A graph is {weakly vertex-transitive, weakly edge-transitive} and {weakly arc-transitive} if its endomorphism monoid acts transitively on the vertex set, edge set and arc set, respectively. If the graph \(X\) is weakly vertex-transitive, weakly edge-transitive, but not weakly arc-transitive, then it is {weakly} \(\frac{1}{2}\)-{arc-transitive}. The authors prove that a graph is weakly \(\frac{1}{2}\)-arc-transitive if and only if its core is \(\frac{1}{2}\)-arc-transitive and every edge of the graph lies in an induced subgraph isomorphic to the core.
    0 references
    endomorphism monoid
    0 references
    core
    0 references
    0 references

    Identifiers