关于图形连通性的数字乔丹曲面定理

IF 1 4区 数学 Q1 MATHEMATICS Open Mathematics Pub Date : 2024-01-06 DOI:10.1515/math-2023-0172
Josef Šlapal
{"title":"关于图形连通性的数字乔丹曲面定理","authors":"Josef Šlapal","doi":"10.1515/math-2023-0172","DOIUrl":null,"url":null,"abstract":"After introducing a graph connectedness induced by a given set of paths of the same length, we focus on the 2-adjacency graph on the digital line <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0172_eq_001.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mi mathvariant=\"double-struck\">Z</m:mi> </m:math> <jats:tex-math>{\\mathbb{Z}}</jats:tex-math> </jats:alternatives> </jats:inline-formula> with a certain set of paths of length <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0172_eq_002.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mi>n</m:mi> </m:math> <jats:tex-math>n</jats:tex-math> </jats:alternatives> </jats:inline-formula> for every positive integer <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" xlink:href=\"graphic/j_math-2023-0172_eq_003.png\" /> <m:math xmlns:m=\"http://www.w3.org/1998/Math/MathML\"> <m:mi>n</m:mi> </m:math> <jats:tex-math>n</jats:tex-math> </jats:alternatives> </jats:inline-formula>. The connectedness in the strong product of three copies of the graph is used to define digital Jordan surfaces. These are obtained as polyhedral surfaces bounding the polyhedra that can be face-to-face tiled with digital tetrahedra.","PeriodicalId":48713,"journal":{"name":"Open Mathematics","volume":"54 1","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2024-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A digital Jordan surface theorem with respect to a graph connectedness\",\"authors\":\"Josef Šlapal\",\"doi\":\"10.1515/math-2023-0172\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"After introducing a graph connectedness induced by a given set of paths of the same length, we focus on the 2-adjacency graph on the digital line <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_math-2023-0172_eq_001.png\\\" /> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mi mathvariant=\\\"double-struck\\\">Z</m:mi> </m:math> <jats:tex-math>{\\\\mathbb{Z}}</jats:tex-math> </jats:alternatives> </jats:inline-formula> with a certain set of paths of length <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_math-2023-0172_eq_002.png\\\" /> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mi>n</m:mi> </m:math> <jats:tex-math>n</jats:tex-math> </jats:alternatives> </jats:inline-formula> for every positive integer <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\\\"http://www.w3.org/1999/xlink\\\" xlink:href=\\\"graphic/j_math-2023-0172_eq_003.png\\\" /> <m:math xmlns:m=\\\"http://www.w3.org/1998/Math/MathML\\\"> <m:mi>n</m:mi> </m:math> <jats:tex-math>n</jats:tex-math> </jats:alternatives> </jats:inline-formula>. The connectedness in the strong product of three copies of the graph is used to define digital Jordan surfaces. These are obtained as polyhedral surfaces bounding the polyhedra that can be face-to-face tiled with digital tetrahedra.\",\"PeriodicalId\":48713,\"journal\":{\"name\":\"Open Mathematics\",\"volume\":\"54 1\",\"pages\":\"\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2024-01-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Open Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1515/math-2023-0172\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Open Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1515/math-2023-0172","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

在介绍了由一组长度相同的给定路径所诱导的图连通性之后,我们将重点放在数字线 Z {\mathbb{Z}} 上的 2-相接图上,对于每一个正整数 n n,该图具有一组长度为 n n 的路径。图的三个副本的强积中的连通性被用来定义数字乔丹曲面。这些曲面作为多面体的边界,可以与数字四面体面对面平铺。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A digital Jordan surface theorem with respect to a graph connectedness
After introducing a graph connectedness induced by a given set of paths of the same length, we focus on the 2-adjacency graph on the digital line Z {\mathbb{Z}} with a certain set of paths of length n n for every positive integer n n . The connectedness in the strong product of three copies of the graph is used to define digital Jordan surfaces. These are obtained as polyhedral surfaces bounding the polyhedra that can be face-to-face tiled with digital tetrahedra.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Open Mathematics
Open Mathematics MATHEMATICS-
CiteScore
2.40
自引率
5.90%
发文量
67
审稿时长
16 weeks
期刊介绍: Open Mathematics - formerly Central European Journal of Mathematics Open Mathematics is a fully peer-reviewed, open access, electronic journal that publishes significant, original and relevant works in all areas of mathematics. The journal provides the readers with free, instant, and permanent access to all content worldwide; and the authors with extensive promotion of published articles, long-time preservation, language-correction services, no space constraints and immediate publication. Open Mathematics is listed in Thomson Reuters - Current Contents/Physical, Chemical and Earth Sciences. Our standard policy requires each paper to be reviewed by at least two Referees and the peer-review process is single-blind. Aims and Scope The journal aims at presenting high-impact and relevant research on topics across the full span of mathematics. Coverage includes:
期刊最新文献
Classification of positive solutions for a weighted integral system on the half-space Trigonometric integrals evaluated in terms of Riemann zeta and Dirichlet beta functions Note on stability estimation of stochastic difference equations Construction of a class of half-discrete Hilbert-type inequalities in the whole plane Analysis of two-grid method for second-order hyperbolic equation by expanded mixed finite element methods
×
引用
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