<P><B>Abstract</B></P><P>A graph is half-arc-transitive if its automorphism group acts transitively on vertices and edges, but not on arcs. It is known that for a prime p there is no tetravalent half-arc-transitive graphs...
http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
https://www.riss.kr/link?id=A107728633
2008
-
SCOPUS,SCIE
학술저널
555-567(13쪽)
0
상세조회0
다운로드다국어 초록 (Multilingual Abstract)
<P><B>Abstract</B></P><P>A graph is half-arc-transitive if its automorphism group acts transitively on vertices and edges, but not on arcs. It is known that for a prime p there is no tetravalent half-arc-transitive graphs...
<P><B>Abstract</B></P><P>A graph is half-arc-transitive if its automorphism group acts transitively on vertices and edges, but not on arcs. It is known that for a prime p there is no tetravalent half-arc-transitive graphs of order p or <SUP>p2</SUP>. Xu [M.Y. Xu, Half-transitive graphs of prime-cube order, J. Algebraic Combin. 1 (1992) 275–282] classified the tetravalent half-arc-transitive graphs of order <SUP>p3</SUP>. As a continuation, we classify in this paper the tetravalent half-arc-transitive graphs of order <SUP>p4</SUP>. It shows that there are exactly p−1 nonisomorphic connected tetravalent half-arc-transitive graphs of order <SUP>p4</SUP> for each odd prime p.</P>