Affine Primitive Groups and Semisymmetric Graphs
Copyright policy )Affine Primitive Groups and Semisymmetric Graphs
In this paper, we investigate semisymmetric graphs which arise from affine primitive permutation groups. We give a characterization of such graphs, and then construct an infinite family of semisymmetric graphs which contains the Gray graph as the third smallest member. Then, as a consequence, we obtain a factorization,of the complete bipartite graph $K_{p^{sp^t},p^{sp^t}}$ into connected semisymmetric graphs, where $p$ is an prime, $1\le t\le s$ with $s\ge2$ while $p=2$.
- Nankai University China (People's Republic of)
normal quotient, primitive permutation group, semisymmetric graph, Finite automorphism groups of algebraic, geometric, or combinatorial structures, Graphs and abstract algebra (groups, rings, fields, etc.)
normal quotient, primitive permutation group, semisymmetric graph, Finite automorphism groups of algebraic, geometric, or combinatorial structures, Graphs and abstract algebra (groups, rings, fields, etc.)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!