首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Almost Covers Of 2-Arc Transitive Graphs
Authors:Email author" target="_blank">Sanming?ZhouEmail author
Institution:(1) Department of Mathematics and Statistics, The University of Melbourne, Parkville, VIC 3010, Australia
Abstract:Let Gamma be a G-symmetric graph whose vertex set admits a nontrivial G-invariant partition bernou with block size v. Let Gamma bernou be the quotient graph of Gamma relative to bernou and GammaB,C] the bipartite subgraph of Gamma induced by adjacent blocks B,C of bernou. In this paper we study such graphs for which Gamma bernou is connected, (G, 2)-arc transitive and is almost covered by Gamma in the sense that GammaB,C] is a matching of v-1 ge 2 edges. Such graphs arose as a natural extremal case in a previous study by the author with Li and Praeger. The case Gamma bernou congK v+1 is covered by results of Gardiner and Praeger. We consider here the general case where Gamma bernou ncongK v+1, and prove that, for some even integer n ge 4, Gamma bernou is a near n-gonal graph with respect to a certain G-orbit on n-cycles of Gamma bernou. Moreover, we prove that every (G, 2)-arc transitive near n-gonal graph with respect to a G-orbit on n-cycles arises as a quotient Gamma bernou of a graph with these properties. (A near n-gonal graph is a connected graph Sgr of girth at least 4 together with a set Escr of n-cycles of Sgr such that each 2-arc of Sgr is contained in a unique member of Escr.)
Keywords:05C25  05E99
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号