Author:
Frucht Roberto,Graver Jack E.,Watkins Mark E.
Abstract
1.Introduction. For integersnandkwith 2 ≤ 2k <n, thegeneralized Petersen graph G(n, k)has been defined in (8) to have vertex-setand edge-setE(G(n, k))to consist of all edges of the formwhereiis an integer.All subscripts in this paper are to be read modulo n, where the particular value ofnwill be clear from the context. ThusG(n, k)is always a trivalent graph of order 2n, andG(5, 2) is the well known Petersen graph. (The subclass of these graphs withnandkrelatively prime was first considered by Coxeter ((2), p. 417ff.).)
Publisher
Cambridge University Press (CUP)
Reference8 articles.
1. (4) Foster Ronald M. Census of trivalent symmetrical graphs, I, presented at the Second Waterloo Combinational Conference,University of Waterloo,Waterloo, Ontario, in April, 1966.
2. A theorem on tait colorings with an application to the generalized Petersen graphs
3. Self-dual configurations and regular graphs
Cited by
134 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献