We investigate the family of vertex-transitive graphs with diameter 2.LetΓbe such a graph.Suppose that its automorphism group is transitive on the set of ordered non-adjacent vertex pairs.Then eitherΓis distance-tra...We investigate the family of vertex-transitive graphs with diameter 2.LetΓbe such a graph.Suppose that its automorphism group is transitive on the set of ordered non-adjacent vertex pairs.Then eitherΓis distance-transitive orΓhas girth at most 4.Moreover,ifΓhas valency 2,thenΓ≌C4 or C5;and for any integer n≥3,there exist such graphsΓof valency n such that its automorphism group is not transitive on the set of arcs.Also,we determine this family of graphs of valency less than 5.Finally,the family of diameter 2 circulants is characterized.展开更多
We classify the family of pentavalent vertex-transitive graphs F with diameter 2. Suppose that the automorphism group of F is transitive on the set of ordered distance 2 vertex pairs. Then we show that either F is dis...We classify the family of pentavalent vertex-transitive graphs F with diameter 2. Suppose that the automorphism group of F is transitive on the set of ordered distance 2 vertex pairs. Then we show that either F is distancetransitive or F is one of C8-, K5 K2, C5[K2], 2C4, or K3 K4.展开更多
The relative xity of a permutation group is the maximum proportion of the points xed by a non-trivial element of the group,and the relative xity of a graph is the relative xity of its automorphism group,viewed as a pe...The relative xity of a permutation group is the maximum proportion of the points xed by a non-trivial element of the group,and the relative xity of a graph is the relative xity of its automorphism group,viewed as a permutation group on the vertex-set of the graph.We prove in this paper that the relative xity of connected 2-arc-transitive graphs of a xed valence tends to 0 as the number of vertices grows to in nity.We prove the same result for the class of arc-transitive graphs of a xed prime valence,and more generally,for any class of arc-transitive locally-L graphs,where L is a xed quasiprimitive graph-restrictive permutation group.展开更多
基金supported by the National Natural Science Foundation of China(12061034,12071484,11661039)Natural Science Foundation of Jiangxi(20212BAB201010,GJJ190273,20192ACBL21007,2018ACB21001)+1 种基金Natural Science Foundation of Hunan(2020JJ4675)China Postdoctoral Science Foundation(2019T120563)。
文摘We investigate the family of vertex-transitive graphs with diameter 2.LetΓbe such a graph.Suppose that its automorphism group is transitive on the set of ordered non-adjacent vertex pairs.Then eitherΓis distance-transitive orΓhas girth at most 4.Moreover,ifΓhas valency 2,thenΓ≌C4 or C5;and for any integer n≥3,there exist such graphsΓof valency n such that its automorphism group is not transitive on the set of arcs.Also,we determine this family of graphs of valency less than 5.Finally,the family of diameter 2 circulants is characterized.
基金Acknowledgements This work was supported by the National Natural Science Foundation of China （Grant Nos. 11561027, 11661039, 61563018）, the Natural Science Foundation of Jiangxi Province （20161BAB211018, 20151BAB201001）, the Jiangxi Education Department Grant （G J J150460, G J J150444）, and the China Postdoctoral Science Foundation （2016M590604）.
文摘We classify the family of pentavalent vertex-transitive graphs F with diameter 2. Suppose that the automorphism group of F is transitive on the set of ordered distance 2 vertex pairs. Then we show that either F is distancetransitive or F is one of C8-, K5 K2, C5[K2], 2C4, or K3 K4.
基金supported by the Austrian Science Fund(FWF)Project W1230-N13.The second author was supported by the Research Programme P1-0294the Research Project J1-1691,both funded by the Slovenian Research Agency(ARRS).
文摘The relative xity of a permutation group is the maximum proportion of the points xed by a non-trivial element of the group,and the relative xity of a graph is the relative xity of its automorphism group,viewed as a permutation group on the vertex-set of the graph.We prove in this paper that the relative xity of connected 2-arc-transitive graphs of a xed valence tends to 0 as the number of vertices grows to in nity.We prove the same result for the class of arc-transitive graphs of a xed prime valence,and more generally,for any class of arc-transitive locally-L graphs,where L is a xed quasiprimitive graph-restrictive permutation group.
