지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
초록· 키워드
오류제보하기
An automorphism group of a graph is said to be s-regular if it acts regularly on the set of s-arcs in the graph. A graph is s-regular if its full automorphism group is s-regular. In the present paper, all s-regular cubic graphs of order 10p3 are classified for each s≥1 and each prime p.
목차
등록된 정보가 없습니다.
참고문헌 (31)
참고문헌 신청
[학술지
A. Malnic / 1993 / Imprimitive graphs and graph coverings / Coding Theory, Design Theory, Group Theory: Proc. M. Hall Memorial Conf : 221 ~ 229
A. Malnic / 1998 / Group actions, coverings and lifts of automorphisms / Discrete Math 182 (1-3) : 203 ~ 218
A. Malnic / 1999 / Constructing in nite one-regular graphs / Euro- pean J. Combin 20 (8) : 845 ~ 853
A. Malnic / 2004 / An in nite family of cubic edge-but not vertex-transitive graphs / Discrete Math 280 (1-3) : 133 ~ 148
A. Malnic / 1993 / Imprimitive graphs and graph coverings / Coding Theory, Design Theory, Group Theory: Proc. M. Hall Memorial Conf : 221 ~ 229
A. Malnic / 1998 / Group actions, coverings and lifts of automorphisms / Discrete Math 182 (1-3) : 203 ~ 218
A. Malnic / 1999 / Constructing in nite one-regular graphs / Euro- pean J. Combin 20 (8) : 845 ~ 853
A. Malnic / 2004 / An in nite family of cubic edge-but not vertex-transitive graphs / Discrete Math 280 (1-3) : 133 ~ 148
이 논문의 저자 정보
최근 본 자료
댓글(0)
0