Edge-transitive Graph

f : G → G

f ( e₁ ) = e₂.

Examples and properties

• Any complete bipartite graph $K\_\{m,n\}$ is edge-transitive.
• Any edge-transitive graph that is not vertex-transitive is bipartite.

See also

• Vertex-transitive graph
• Arc-transitive graph
• Semi-symmetric graph

<< Previous Word Browser Next >>
pnh octahedral number polarization (politics) polarization (psychology) soft point bullet great eastern main line great western main line operation mockingbird u.s. congressional delegations from connecticut tinsagu nu hana treatment action campaign	hiram m. chittenden locks ryukyuan songs patrick bouvier kennedy james strang rafah list of english words of etruscan origin portuguese galician koeberg bbc sports personality of the year lifetime achievement award evidentialism bbc sports personality of the year coach award	ryukyuan languages talyn fred lawrence whipple okanogan national forest bbc sports personality of the year helen rollason award ctg bbc sports personality of the year young personality bbc sports personality of the year unsung hero award contraction (childbirth) mendocino national forest gentle on my mind	alt camp abc800 edward emerson barnard winner's curse memphis soul johann daniel titius alt empord fetal distress cardiotocography alfred newman federico maria sardelli