Coset graph

Definition

Coset graph is a graph with vertex set and iff .

Proposition

is transitive on the vertex set and transitive on the arc set .

\begin{proof} Consider the set of vertices which are adjacent to , denoted as . Note is an arc if , so . Since acting on transitively, acting on arc set transitively. \end{proof}

Remark. Coset graph is a particular case of Sabidussi graph.

Proposition

and the valency of is .

\begin{proof} For any fixed vertex , the valency of is

By , we know the valency of is and so for . \end{proof}

Proposition

is connected iff .

\begin{proof} Assume is connected. Then for any and , there exists such that and are in the arc set. Then for all . It deduces that and so .

Conversely, if can be generated by and , any can be written as . Then , , , are arcs. Note that , and are connected and so for . \end{proof}

Proposition

is undirected iff .

\begin{proof} Assume that . For any , . Thus is undirected.

Conversely, assume that is undirected. Then for any , we have and . Thus . Symmetrically, and so . Note that yields . Thus and . Therefore, . \end{proof}

Quotient graph

quotient graph

Let . Let be a partition of , say . Define a graph with vertex set such that iff there exists and such that in .

Lemma

Suppose . Let be a block system for on . i.e. is a -invarient partition. Then:

  • if is -vertex transitive, then is also -vertex transitive.
  • if is a connected -arc transitive graph, then is also -arc transitive.

Remark. does not yield . For example, consider Example 2, , but and so .

cover

If each vertex in is adjacent to exactly one vertex in whenever in , is called a cover of .

Remark. Consider cover instead of quotient graph is important. See here.