Skip Navigation

Journal of the London Mathematical Society 1977 s2-15(3):377-383; doi:10.1112/jlms/s2-15.3.377
© 1977 by London Mathematical Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Farzan, M.
Right arrow Articles by Waller, D. A.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© Oxford University Press

Antipodal Embeddings of Graphs

M. Farzan and D. A. Waller

Department of Pure Mathematics, University College of Swansea Swansea, SA2 8PP, Great Britain

An antipodal graph D of diameter d has the property that each vertex {upsilon} has a unique (antipodal) vertex {upsilon} at distance d from {upsilon} in D. We show that any such D has circuits of length 2d passing through antipodal pairs of vertices. The identification of antipodal vertex-pairs in D produces a quotient graph G with a double cover projection morphism p : D->G. Using the two-fold quotient map of surfaces {pi} : S2->RP2 where the real projective plane is obtained from the sphere, we study the relation between embeddings of a planar graph in S2 and embeddings of G in RP2. In particular, our main theorem establishes that every planar antipodal graph D has an embedding in S2 such that p is a restriction of the projection {pi}.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.