Re-1-embeddings of optimal 1-embedded graphs on the projective plane

IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Discrete Applied Mathematics Pub Date : 2024-10-24 DOI:10.1016/j.dam.2024.10.005
Yusuke Suzuki
{"title":"Re-1-embeddings of optimal 1-embedded graphs on the projective plane","authors":"Yusuke Suzuki","doi":"10.1016/j.dam.2024.10.005","DOIUrl":null,"url":null,"abstract":"<div><div>It was shown in Schumacher (1986), Suzuki (2010) that every optimal 1-embedded graph on the sphere has at most 8 inequivalent 1-embeddings. In this paper, we prove that the number of inequivalent 1-embeddings of an optimal 1-embedded graph on the projective plane whose quadrangular subgraph is bipartite is at most 24. In the case where such quadrangular subgraphs are nonbipartite, we show an optimal 1-embedded graph having at least <span><math><mi>p</mi></math></span> inequivalent 1-embeddings for any large integer <span><math><mi>p</mi></math></span>.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"360 ","pages":"Pages 487-496"},"PeriodicalIF":1.0000,"publicationDate":"2024-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X24004311","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

It was shown in Schumacher (1986), Suzuki (2010) that every optimal 1-embedded graph on the sphere has at most 8 inequivalent 1-embeddings. In this paper, we prove that the number of inequivalent 1-embeddings of an optimal 1-embedded graph on the projective plane whose quadrangular subgraph is bipartite is at most 24. In the case where such quadrangular subgraphs are nonbipartite, we show an optimal 1-embedded graph having at least p inequivalent 1-embeddings for any large integer p.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
投影面上最优 1 嵌入图的 Re-1 嵌入
Schumacher (1986) 和 Suzuki (2010) 的研究表明,球面上的每个最优 1 嵌入图最多有 8 个不等价 1 嵌入。在本文中,我们证明了投影平面上的最优 1- 嵌入图的不等价 1- 嵌入的数量最多为 24,而该图的四角子图是双方形的。在这种四角形子图是非双方形的情况下,我们证明了一个最优 1 嵌入图在任意大整数 p 下至少有 p 个不等价 1 嵌入。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Discrete Applied Mathematics
Discrete Applied Mathematics 数学-应用数学
CiteScore
2.30
自引率
9.10%
发文量
422
审稿时长
4.5 months
期刊介绍: The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal. Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.
期刊最新文献
Multiplicity of signless Laplacian eigenvalue 2 of a connected graph with a perfect matching Rainbow short linear forests in edge-colored complete graph Resistance distances in generalized join graphs Partitions of Zm with identical representation functions Complexity of Maker–Breaker games on edge sets of graphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1