- Journal Home
- Volume 41 - 2025
- Volume 40 - 2024
- Volume 39 - 2023
- Volume 38 - 2022
- Volume 37 - 2021
- Volume 36 - 2020
- Volume 35 - 2019
- Volume 34 - 2018
- Volume 33 - 2017
- Volume 32 - 2016
- Volume 31 - 2015
- Volume 30 - 2014
- Volume 29 - 2013
- Volume 28 - 2012
- Volume 27 - 2011
- Volume 26 - 2010
- Volume 25 - 2009
Cited by
- BibTex
- RIS
- TXT
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.
}, issn = {2707-8523}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/cmr/19159.html} }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.