{"title":"具有两个可定向边传递嵌入的完全二部图","authors":"Xue Yu, B. Lou, Wenwen Fan","doi":"10.26493/1855-3974.1900.cc1","DOIUrl":null,"url":null,"abstract":"In 2018, Fan and Li classified the complete bipartite graph K m , n that has a unique orientably edge-transitive embedding. In this paper, we extend this to give a complete classification of K m , n which have exactly two orientably edge-transitive embeddings.","PeriodicalId":8402,"journal":{"name":"Ars Math. Contemp.","volume":"1 1","pages":"371-379"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"The complete bipartite graphs which have exactly two orientably edge-transitive embeddings\",\"authors\":\"Xue Yu, B. Lou, Wenwen Fan\",\"doi\":\"10.26493/1855-3974.1900.cc1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In 2018, Fan and Li classified the complete bipartite graph K m , n that has a unique orientably edge-transitive embedding. In this paper, we extend this to give a complete classification of K m , n which have exactly two orientably edge-transitive embeddings.\",\"PeriodicalId\":8402,\"journal\":{\"name\":\"Ars Math. Contemp.\",\"volume\":\"1 1\",\"pages\":\"371-379\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ars Math. Contemp.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.26493/1855-3974.1900.cc1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ars Math. Contemp.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.26493/1855-3974.1900.cc1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
摘要
2018年,Fan和Li分类了具有唯一可定向边传递嵌入的完全二部图K m, n。在本文中,我们推广了这一理论,给出了K m n的完全分类,其中K m n恰好有两个可定向的边传递嵌入。
The complete bipartite graphs which have exactly two orientably edge-transitive embeddings
In 2018, Fan and Li classified the complete bipartite graph K m , n that has a unique orientably edge-transitive embedding. In this paper, we extend this to give a complete classification of K m , n which have exactly two orientably edge-transitive embeddings.