The complete bipartite graphs which have exactly two orientably edge-transitive embeddings

Authors

  • Xue Yu Henan Institute of Science and Technology, China and Yunnan University, China
  • Ben Gong Lou Yunnan University, China
  • Wen Wen Fan Yunnan Normal University, China

DOI:

https://doi.org/10.26493/1855-3974.1900.cc1

Keywords:

Bipartite graphs, edge-transitive embeddings

Abstract

In 2018, Fan and Li classified the complete bipartite graph Km, n that has a unique orientably edge-transitive embedding. In this paper, we extend this to give a complete classification of Km, n which have exactly two orientably edge-transitive embeddings.

Downloads

Published

2020-10-23

Issue

Vol. 18 No. 2 (2020)

Section

Articles

License

Articles in this journal are published under Creative Commons Attribution 4.0 International License
https://creativecommons.org/licenses/by/4.0/