有理平均度r∈(3.5,4)的h=1的无限族((2h+32))-交临界图的书嵌入

IF 1.3 4区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS Distributed Computing Pub Date : 2021-01-06 DOI:10.35799/DC.9.2.2020.29166
Sheren H. Wilar, B. Pinontoan, C. Montolalu
{"title":"有理平均度r∈(3.5,4)的h=1的无限族((2h+32))-交临界图的书嵌入","authors":"Sheren H. Wilar, B. Pinontoan, C. Montolalu","doi":"10.35799/DC.9.2.2020.29166","DOIUrl":null,"url":null,"abstract":"A principal tool used in construction of crossing-critical graphs are tiles. In the tile concept, tiles can be arranged by gluing one tile to another in a linear or circular fashion. The series of tiles with circular fashion form an infinite graph family. In this way, the intersection number of this family of graphs can be determined. In this research, has been formed an infinite family graphs Q(1,s,b)(n) with average degree r between 3.5 and 4. The graph formed by gluing together many copies of the tile P(1,s,b) in circular fashion, where the tile P(1,s,b) consist of two identical pieces of tile. And then, the graph embedded into the book to determine the pagenumber that can be formed. When embed graph into book, the vertices are put on a line called the spine and the edges are put on half-planes called the pages. The results obtained show that the graph Q(1,s,b)(n) has 10-crossing-critical and book embedding of graph has 4-page book. ARTICLE INFO: Received : 13 July 2020 Received after revision : 29 August 2020 Available online : 5 January 2021","PeriodicalId":50569,"journal":{"name":"Distributed Computing","volume":"9 1","pages":"145"},"PeriodicalIF":1.3000,"publicationDate":"2021-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Book Embedding of Infinite Family ((2h+3 2))-Crossing-Critical Graphs for h=1 with Rational Average Degree r∈(3.5,4)\",\"authors\":\"Sheren H. Wilar, B. Pinontoan, C. Montolalu\",\"doi\":\"10.35799/DC.9.2.2020.29166\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A principal tool used in construction of crossing-critical graphs are tiles. In the tile concept, tiles can be arranged by gluing one tile to another in a linear or circular fashion. The series of tiles with circular fashion form an infinite graph family. In this way, the intersection number of this family of graphs can be determined. In this research, has been formed an infinite family graphs Q(1,s,b)(n) with average degree r between 3.5 and 4. The graph formed by gluing together many copies of the tile P(1,s,b) in circular fashion, where the tile P(1,s,b) consist of two identical pieces of tile. And then, the graph embedded into the book to determine the pagenumber that can be formed. When embed graph into book, the vertices are put on a line called the spine and the edges are put on half-planes called the pages. The results obtained show that the graph Q(1,s,b)(n) has 10-crossing-critical and book embedding of graph has 4-page book. ARTICLE INFO: Received : 13 July 2020 Received after revision : 29 August 2020 Available online : 5 January 2021\",\"PeriodicalId\":50569,\"journal\":{\"name\":\"Distributed Computing\",\"volume\":\"9 1\",\"pages\":\"145\"},\"PeriodicalIF\":1.3000,\"publicationDate\":\"2021-01-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Distributed Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.35799/DC.9.2.2020.29166\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Distributed Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.35799/DC.9.2.2020.29166","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

在交叉临界图的构造中使用的一个主要工具是瓦片。在瓦片概念中,瓦片可以通过将一个瓦片以线性或圆形的方式粘合到另一个瓦片来布置。圆形瓷砖系列形成了一个无限图形族。通过这种方式,可以确定该图族的交集数。在本研究中,形成了一个平均阶数r在3.5~4之间的无限族图Q(1,s,b)(n)。通过以圆形方式将瓦片P(1,s,b)的许多副本粘合在一起而形成的图,其中瓦片P(2,s,c)由两块相同的瓦片组成。然后,将图形嵌入到书中,确定可以形成的页码。当把图形嵌入书中时,顶点放在一条称为书脊的线上,边放在称为页面的半平面上。结果表明,图Q(1,s,b)(n)具有10个交叉临界,图的书嵌入具有4页书。文章信息:收到时间:2020年7月13日修订后收到时间:2019年8月29日在线发布时间:2021年1月5日
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Book Embedding of Infinite Family ((2h+3 2))-Crossing-Critical Graphs for h=1 with Rational Average Degree r∈(3.5,4)
A principal tool used in construction of crossing-critical graphs are tiles. In the tile concept, tiles can be arranged by gluing one tile to another in a linear or circular fashion. The series of tiles with circular fashion form an infinite graph family. In this way, the intersection number of this family of graphs can be determined. In this research, has been formed an infinite family graphs Q(1,s,b)(n) with average degree r between 3.5 and 4. The graph formed by gluing together many copies of the tile P(1,s,b) in circular fashion, where the tile P(1,s,b) consist of two identical pieces of tile. And then, the graph embedded into the book to determine the pagenumber that can be formed. When embed graph into book, the vertices are put on a line called the spine and the edges are put on half-planes called the pages. The results obtained show that the graph Q(1,s,b)(n) has 10-crossing-critical and book embedding of graph has 4-page book. ARTICLE INFO: Received : 13 July 2020 Received after revision : 29 August 2020 Available online : 5 January 2021
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Distributed Computing
Distributed Computing 工程技术-计算机:理论方法
CiteScore
3.20
自引率
0.00%
发文量
24
审稿时长
>12 weeks
期刊介绍: The international journal Distributed Computing provides a forum for original and significant contributions to the theory, design, specification and implementation of distributed systems. Topics covered by the journal include but are not limited to: design and analysis of distributed algorithms; multiprocessor and multi-core architectures and algorithms; synchronization protocols and concurrent programming; distributed operating systems and middleware; fault-tolerance, reliability and availability; architectures and protocols for communication networks and peer-to-peer systems; security in distributed computing, cryptographic protocols; mobile, sensor, and ad hoc networks; internet applications; concurrency theory; specification, semantics, verification, and testing of distributed systems. In general, only original papers will be considered. By virtue of submitting a manuscript to the journal, the authors attest that it has not been published or submitted simultaneously for publication elsewhere. However, papers previously presented in conference proceedings may be submitted in enhanced form. If a paper has appeared previously, in any form, the authors must clearly indicate this and provide an account of the differences between the previously appeared form and the submission.
期刊最新文献
A wait-free queue with polylogarithmic step complexity Deterministic near-optimal distributed listing of cliques On implementing SWMR registers from SWSR registers in systems with Byzantine failures Developing Irelands first National Student Mental Health and Suicide Prevention Framework for Higher Education. Asymmetric distributed trust
×
引用
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