<P>A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. Malnič et al. (Discrete Math 274 (2004), 187–198) classified the connected cubic edge-transitive, but not vertex-transitive graphs of order 2...
http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
https://www.riss.kr/link?id=A107625092
2006
-
SCI,SCIE,SCOPUS
학술저널
341-352(12쪽)
0
상세조회0
다운로드다국어 초록 (Multilingual Abstract)
<P>A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. Malnič et al. (Discrete Math 274 (2004), 187–198) classified the connected cubic edge-transitive, but not vertex-transitive graphs of order 2...
<P>A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. Malnič et al. (Discrete Math 274 (2004), 187–198) classified the connected cubic edge-transitive, but not vertex-transitive graphs of order 2p<SUP>3</SUP> for each prime p. In this article, we determine the s-regularity of all connected cubic symmetric graphs of order 2p<SUP>3</SUP> for each prime p and each s. © 2006 Wiley Periodicals, Inc. J Graph Theory</P>