互补环棱镜中的识别码

Márcia R. Cappelle , Erika M.M. Coelho , Hebert Coelho , Lucia D. Penso, Dieter Rautenbach
{"title":"互补环棱镜中的识别码","authors":"Márcia R. Cappelle ,&nbsp;Erika M.M. Coelho ,&nbsp;Hebert Coelho ,&nbsp;Lucia D. Penso,&nbsp;Dieter Rautenbach","doi":"10.1016/j.entcs.2019.08.022","DOIUrl":null,"url":null,"abstract":"<div><p>We show that an identifying code of minimum order in the complementary prism of a cycle of order <em>n</em> has order 7<em>n/</em>9 + Θ(1). Furthermore, we observe that the clique-width of the complementary prism of a graph of clique-width <em>k</em> is at most 4<em>k</em>, and discuss some algorithmic consequences.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":"346 ","pages":"Pages 241-251"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2019.08.022","citationCount":"3","resultStr":"{\"title\":\"Identifying Codes in the Complementary Prism of Cycles\",\"authors\":\"Márcia R. Cappelle ,&nbsp;Erika M.M. Coelho ,&nbsp;Hebert Coelho ,&nbsp;Lucia D. Penso,&nbsp;Dieter Rautenbach\",\"doi\":\"10.1016/j.entcs.2019.08.022\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We show that an identifying code of minimum order in the complementary prism of a cycle of order <em>n</em> has order 7<em>n/</em>9 + Θ(1). Furthermore, we observe that the clique-width of the complementary prism of a graph of clique-width <em>k</em> is at most 4<em>k</em>, and discuss some algorithmic consequences.</p></div>\",\"PeriodicalId\":38770,\"journal\":{\"name\":\"Electronic Notes in Theoretical Computer Science\",\"volume\":\"346 \",\"pages\":\"Pages 241-251\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.entcs.2019.08.022\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Notes in Theoretical Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1571066119300726\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Theoretical Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571066119300726","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 3

摘要

我们证明了在n阶循环的互补棱镜中最小阶的识别码的阶为7n/9 + Θ(1)。此外,我们观察到团宽度为k的图的互补棱镜的团宽度最多为4k,并讨论了一些算法结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Identifying Codes in the Complementary Prism of Cycles

We show that an identifying code of minimum order in the complementary prism of a cycle of order n has order 7n/9 + Θ(1). Furthermore, we observe that the clique-width of the complementary prism of a graph of clique-width k is at most 4k, and discuss some algorithmic consequences.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Electronic Notes in Theoretical Computer Science
Electronic Notes in Theoretical Computer Science Computer Science-Computer Science (all)
自引率
0.00%
发文量
0
期刊介绍: ENTCS is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication and the availability on the electronic media is appropriate. Organizers of conferences whose proceedings appear in ENTCS, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.
期刊最新文献
Preface Murphree's Numerical Term Logic Tableaux A Note on Constructive Interpolation for the Multi-Modal Logic Km Paracomplete Logics Dual to the Genuine Paraconsistent Logics: The Three-valued Case Building a Maximal Independent Set for the Vertex-coloring Problem on Planar 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