All graphs are finite simple undirected and of no isolated vertices in this paper. Using the theory of coset graphs and permutation groups, it is completed that a classification of locally transitive graphs admitting ...All graphs are finite simple undirected and of no isolated vertices in this paper. Using the theory of coset graphs and permutation groups, it is completed that a classification of locally transitive graphs admitting a non-Abelian group with cyclic Sylow subgroups. They are either the union of the family of arc-transitive graphs, or the union of the family of bipartite edge-transitive graphs.展开更多
基金The NSF (60776810,10871205) of Chinathe NSF (08JCYBJC13900) of Tianjin
文摘All graphs are finite simple undirected and of no isolated vertices in this paper. Using the theory of coset graphs and permutation groups, it is completed that a classification of locally transitive graphs admitting a non-Abelian group with cyclic Sylow subgroups. They are either the union of the family of arc-transitive graphs, or the union of the family of bipartite edge-transitive graphs.
