Back to Search Start Over

A classification of tightly attached half-arc-transitive graphs of valency 4

Authors :
Šparl, Primož
Source :
Journal of Combinatorial Theory - Series B. Sep2008, Vol. 98 Issue 5, p1076-1108. 33p.
Publication Year :
2008

Abstract

Abstract: A graph is said to be half-arc-transitive if its automorphism group acts transitively on the set of its vertices and edges but not on the set of its arcs. With each half-arc-transitive graph of valency 4 a collection of the so-called alternating cycles is associated, all of which have the same even length. Half of this length is called the radius of the graph in question. Moreover, any two adjacent alternating cycles have the same number of common vertices. If this number, the so-called attachment number, coincides with the radius, we say that the graph is tightly attached. In [D. Marušič, Half-transitive group actions on finite graphs of valency 4, J. Combin. Theory Ser. B 73 (1998) 41–76], Marušič gave a classification of tightly attached half-arc-transitive graphs of valency 4 with odd radius. In this paper the even radius tightly attached graphs of valency 4 are classified, thus completing the classification of all tightly attached half-arc-transitive graphs of valency 4. [Copyright &y& Elsevier]

Details

Language :
English
ISSN :
00958956
Volume :
98
Issue :
5
Database :
Academic Search Index
Journal :
Journal of Combinatorial Theory - Series B
Publication Type :
Academic Journal
Accession number :
34001910
Full Text :
https://doi.org/10.1016/j.jctb.2008.01.001