$$l_{1}$$ -embeddability of shifted quadrilateral cylinder graphs

IF 0.6 4区 数学 Q3 MATHEMATICS Graphs and Combinatorics Pub Date : 2023-11-29 DOI:10.1007/s00373-023-02725-w
Guangfu Wang, Zhikun Xiong, Lijun Chen
{"title":"$$l_{1}$$ -embeddability of shifted quadrilateral cylinder graphs","authors":"Guangfu Wang, Zhikun Xiong, Lijun Chen","doi":"10.1007/s00373-023-02725-w","DOIUrl":null,"url":null,"abstract":"<p>A connected graph <i>G</i> is called <span>\\(l_{1}\\)</span>-embeddable, if it can be isometrically embedded into the <span>\\(l_{1}\\)</span>-space. The shifted quadrilateral cylinder graph <span>\\(O_{m,n,k}\\)</span> is a class of quadrilateral tilings on a cylinder obtained by rolling the grid graph <span>\\(P_{m}\\square P_{n}\\)</span> via shifting <i>k</i> positions. In this article, we determine that all the <span>\\(O_{m,n,k}\\)</span> are not <span>\\(l_{1}\\)</span>-embeddable except for <span>\\(O_{m,n,0}\\)</span> and <span>\\(O_{m,3,1}\\)</span>.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":"195 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2023-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Graphs and Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00373-023-02725-w","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

A connected graph G is called \(l_{1}\)-embeddable, if it can be isometrically embedded into the \(l_{1}\)-space. The shifted quadrilateral cylinder graph \(O_{m,n,k}\) is a class of quadrilateral tilings on a cylinder obtained by rolling the grid graph \(P_{m}\square P_{n}\) via shifting k positions. In this article, we determine that all the \(O_{m,n,k}\) are not \(l_{1}\)-embeddable except for \(O_{m,n,0}\) and \(O_{m,3,1}\).

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
$$l_{1}$$ 移位四边形柱面图的可嵌入性
称为连通图G \(l_{1}\)-可嵌入,如果它可以等距嵌入到 \(l_{1}\)-space。移位的四边形柱面图 \(O_{m,n,k}\) 是否通过滚动网格图获得圆柱体上的一类四边形平铺 \(P_{m}\square P_{n}\) 通过移动k个位置。在本文中,我们确定所有的 \(O_{m,n,k}\) 不是 \(l_{1}\)-可嵌入的,除了 \(O_{m,n,0}\) 和 \(O_{m,3,1}\).
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Graphs and Combinatorics
Graphs and Combinatorics 数学-数学
CiteScore
1.00
自引率
14.30%
发文量
160
审稿时长
6 months
期刊介绍: Graphs and Combinatorics is an international journal devoted to research concerning all aspects of combinatorial mathematics. In addition to original research papers, the journal also features survey articles from authors invited by the editorial board.
期刊最新文献
An Efficient Algorithm to Compute the Toughness in Graphs with Bounded Treewidth Existential Closure in Line Graphs The Planar Turán Number of $$\{K_4,C_5\}$$ and $$\{K_4,C_6\}$$ On the Complexity of Local-Equitable Coloring in Claw-Free Graphs with Small Degree New Tools to Study 1-11-Representation 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