Ler G = ( V, E) be a finite simple graph and Pn denote the path of order n. A spanning subgraph F is called a { P2, P3 }-factor of G if each component of F is isomorphic to P2 or P3. With the path-covering method, i...Ler G = ( V, E) be a finite simple graph and Pn denote the path of order n. A spanning subgraph F is called a { P2, P3 }-factor of G if each component of F is isomorphic to P2 or P3. With the path-covering method, it is proved that any connected cubic graph with at least 5 vertices has a { P2, P3 }-factor F such that|P3(F)|P2(F)|, where P2(F) and P3(F) denote the set of components of P2 and P3 in F, respectively.展开更多
A graph is called s-regular if its automorphism group acts regularly on the set of its s-arcs. In this paper, the s-regular cyclic or elementary abelian coverings of the Petersen graph for each s ≥ 1 are classified w...A graph is called s-regular if its automorphism group acts regularly on the set of its s-arcs. In this paper, the s-regular cyclic or elementary abelian coverings of the Petersen graph for each s ≥ 1 are classified when the fibre-preserving automorphism groups act arc-transitively.As an application of these results, all s-regular cubic graphs of order 10p or 10p2 are also classified for each s ≥ 1 and each prime p, of which the proof depends on the classification of finite simple groups.展开更多
文摘Ler G = ( V, E) be a finite simple graph and Pn denote the path of order n. A spanning subgraph F is called a { P2, P3 }-factor of G if each component of F is isomorphic to P2 or P3. With the path-covering method, it is proved that any connected cubic graph with at least 5 vertices has a { P2, P3 }-factor F such that|P3(F)|P2(F)|, where P2(F) and P3(F) denote the set of components of P2 and P3 in F, respectively.
基金Project supported by the National Natural Science Foundation of China (No.19831050, No.10171086) the Shanxi Provincial Natural Science Foundation of China (No.20011004)+1 种基金 the Key Program of the Ministry of Education of China (No.02023) the Returned A
文摘In this paper, a complete classification of arc-transitive cubic graphs of order 4p is given.
基金suppeorted by the National Natural Science Foundation ofChina(Grant No.10571013)the Key Project of Chinese Ministry of Education Com2 Mac-KOSEF in Korea(Grant No.R11-1999-054).
文摘A graph is called s-regular if its automorphism group acts regularly on the set of its s-arcs. In this paper, the s-regular cyclic or elementary abelian coverings of the Petersen graph for each s ≥ 1 are classified when the fibre-preserving automorphism groups act arc-transitively.As an application of these results, all s-regular cubic graphs of order 10p or 10p2 are also classified for each s ≥ 1 and each prime p, of which the proof depends on the classification of finite simple groups.