Abstract
Given a groupG, a subgroupHand an elementa∈G, we define Γ(G, H, a) to be the graph on the set of left-cosets ofHinG, where two left-cosetsg1Handg2Hare adjacent whenever. We will consider this construction only in the case thatThe first of these conditions assures that adjacency is a symmetric relation (i.e. that Γ(G, H, a) is an undirected graph) and the second assures that Γ(G, H, a) is connected.
Publisher
Cambridge University Press (CUP)
Reference17 articles.
1. Distance-transitive graphs and generalized polygons
2. A characterization and another construction of Janko's group J3;Weiss;Trans. Amer. Math. Soc. Soc
3. Sur la trialité et certains groupes qui s’en déduisent
4. Regular groups of automorphisms of cubic graphs
5. A characterization of;Weiss;Algebras, Groups and Geometries
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献