局部有限顶点旋转映射和具有有限价及有限边乘数的余集图

IF 1.2 1区 数学 Q1 MATHEMATICS Journal of Combinatorial Theory Series B Pub Date : 2024-06-11 DOI:10.1016/j.jctb.2024.05.005
Cai Heng Li , Cheryl E. Praeger , Shu Jiao Song
{"title":"局部有限顶点旋转映射和具有有限价及有限边乘数的余集图","authors":"Cai Heng Li ,&nbsp;Cheryl E. Praeger ,&nbsp;Shu Jiao Song","doi":"10.1016/j.jctb.2024.05.005","DOIUrl":null,"url":null,"abstract":"<div><p>A well-known theorem of Sabidussi shows that a simple <em>G</em>-arc-transitive graph can be represented as a coset graph for the group <em>G</em>. This pivotal result is the standard way to turn problems about simple arc-transitive graphs into questions about groups. In this paper, the Sabidussi representation is extended to arc-transitive, not necessarily simple graphs which satisfy a local-finiteness condition: namely graphs with finite valency and finite edge-multiplicity. The construction yields a <em>G</em>-arc-transitive coset graph <span><math><mrow><mi>Cos</mi></mrow><mo>(</mo><mi>G</mi><mo>,</mo><mi>H</mi><mo>,</mo><mi>J</mi><mo>)</mo></math></span>, where <span><math><mi>H</mi><mo>,</mo><mi>J</mi></math></span> are stabilisers in <em>G</em> of a vertex and incident edge, respectively. A first major application is presented concerning arc-transitive maps on surfaces: given a group <span><math><mi>G</mi><mo>=</mo><mo>〈</mo><mi>a</mi><mo>,</mo><mi>z</mi><mo>〉</mo></math></span> with <span><math><mo>|</mo><mi>z</mi><mo>|</mo><mo>=</mo><mn>2</mn></math></span> and <span><math><mo>|</mo><mi>a</mi><mo>|</mo></math></span> finite, the coset graph <span><math><mrow><mi>Cos</mi></mrow><mo>(</mo><mi>G</mi><mo>,</mo><mo>〈</mo><mi>a</mi><mo>〉</mo><mo>,</mo><mo>〈</mo><mi>z</mi><mo>〉</mo><mo>)</mo></math></span> is shown, under suitable finiteness assumptions, to have exactly two different arc-transitive embeddings as a <em>G</em>-arc-transitive map <span><math><mo>(</mo><mi>V</mi><mo>,</mo><mi>E</mi><mo>,</mo><mi>F</mi><mo>)</mo></math></span> (with <span><math><mi>V</mi><mo>,</mo><mi>E</mi><mo>,</mo><mi>F</mi></math></span> the sets of vertices, edges and faces, respectively), namely, a <em>G-rotary</em> map if <span><math><mo>|</mo><mi>a</mi><mi>z</mi><mo>|</mo></math></span> is finite, and a <em>G-bi-rotary</em> map if <span><math><mo>|</mo><mi>z</mi><msup><mrow><mi>z</mi></mrow><mrow><mi>a</mi></mrow></msup><mo>|</mo></math></span> is finite. The <em>G</em>-rotary map can be represented as a coset geometry for <em>G</em>, extending the notion of a coset graph. However the <em>G</em>-bi-rotary map does not have such a representation, and the face boundary cycles must be specified in addition to incidences between faces and edges. In addition a coset geometry construction is given of a flag-regular map <span><math><mo>(</mo><mi>V</mi><mo>,</mo><mi>E</mi><mo>,</mo><mi>F</mi><mo>)</mo></math></span> for non necessarily simple graphs. For all of these constructions it is proved that the face boundary cycles are simple cycles precisely when the given group acts faithfully on <span><math><mi>V</mi><mo>∪</mo><mi>F</mi></math></span>. Illustrative examples are given for graphs related to the <em>n</em>-dimensional hypercubes and the Petersen graph.</p></div>","PeriodicalId":54865,"journal":{"name":"Journal of Combinatorial Theory Series B","volume":"169 ","pages":"Pages 1-44"},"PeriodicalIF":1.2000,"publicationDate":"2024-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Locally finite vertex-rotary maps and coset graphs with finite valency and finite edge multiplicity\",\"authors\":\"Cai Heng Li ,&nbsp;Cheryl E. Praeger ,&nbsp;Shu Jiao Song\",\"doi\":\"10.1016/j.jctb.2024.05.005\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>A well-known theorem of Sabidussi shows that a simple <em>G</em>-arc-transitive graph can be represented as a coset graph for the group <em>G</em>. This pivotal result is the standard way to turn problems about simple arc-transitive graphs into questions about groups. In this paper, the Sabidussi representation is extended to arc-transitive, not necessarily simple graphs which satisfy a local-finiteness condition: namely graphs with finite valency and finite edge-multiplicity. The construction yields a <em>G</em>-arc-transitive coset graph <span><math><mrow><mi>Cos</mi></mrow><mo>(</mo><mi>G</mi><mo>,</mo><mi>H</mi><mo>,</mo><mi>J</mi><mo>)</mo></math></span>, where <span><math><mi>H</mi><mo>,</mo><mi>J</mi></math></span> are stabilisers in <em>G</em> of a vertex and incident edge, respectively. A first major application is presented concerning arc-transitive maps on surfaces: given a group <span><math><mi>G</mi><mo>=</mo><mo>〈</mo><mi>a</mi><mo>,</mo><mi>z</mi><mo>〉</mo></math></span> with <span><math><mo>|</mo><mi>z</mi><mo>|</mo><mo>=</mo><mn>2</mn></math></span> and <span><math><mo>|</mo><mi>a</mi><mo>|</mo></math></span> finite, the coset graph <span><math><mrow><mi>Cos</mi></mrow><mo>(</mo><mi>G</mi><mo>,</mo><mo>〈</mo><mi>a</mi><mo>〉</mo><mo>,</mo><mo>〈</mo><mi>z</mi><mo>〉</mo><mo>)</mo></math></span> is shown, under suitable finiteness assumptions, to have exactly two different arc-transitive embeddings as a <em>G</em>-arc-transitive map <span><math><mo>(</mo><mi>V</mi><mo>,</mo><mi>E</mi><mo>,</mo><mi>F</mi><mo>)</mo></math></span> (with <span><math><mi>V</mi><mo>,</mo><mi>E</mi><mo>,</mo><mi>F</mi></math></span> the sets of vertices, edges and faces, respectively), namely, a <em>G-rotary</em> map if <span><math><mo>|</mo><mi>a</mi><mi>z</mi><mo>|</mo></math></span> is finite, and a <em>G-bi-rotary</em> map if <span><math><mo>|</mo><mi>z</mi><msup><mrow><mi>z</mi></mrow><mrow><mi>a</mi></mrow></msup><mo>|</mo></math></span> is finite. The <em>G</em>-rotary map can be represented as a coset geometry for <em>G</em>, extending the notion of a coset graph. However the <em>G</em>-bi-rotary map does not have such a representation, and the face boundary cycles must be specified in addition to incidences between faces and edges. In addition a coset geometry construction is given of a flag-regular map <span><math><mo>(</mo><mi>V</mi><mo>,</mo><mi>E</mi><mo>,</mo><mi>F</mi><mo>)</mo></math></span> for non necessarily simple graphs. For all of these constructions it is proved that the face boundary cycles are simple cycles precisely when the given group acts faithfully on <span><math><mi>V</mi><mo>∪</mo><mi>F</mi></math></span>. Illustrative examples are given for graphs related to the <em>n</em>-dimensional hypercubes and the Petersen graph.</p></div>\",\"PeriodicalId\":54865,\"journal\":{\"name\":\"Journal of Combinatorial Theory Series B\",\"volume\":\"169 \",\"pages\":\"Pages 1-44\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2024-06-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Theory Series B\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0095895624000443\",\"RegionNum\":1,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory Series B","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0095895624000443","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

萨比杜西(Sabidussi)的一个著名定理表明,简单的 G-弧透图可以表示为群 G 的余集图。这一关键结果是将简单弧透图问题转化为群问题的标准方法。在本文中,萨比杜西表示法被扩展到了满足局部有限性条件的弧遍历图,而不一定是简单图:即具有有限价和有限边多重性的图。该构造产生了一个 G-弧遍历余集图 Cos(G,H,J),其中 H,J 分别是顶点和入射边在 G 中的稳定器。本文提出的第一个主要应用涉及曲面上的弧跨映射:给定一个组 G=〈a,z〉,|z|=2,|a|有限,在适当的有限性假设下,证明了余集图 Cos(G,〈a〉,〈z〉) 作为 G-弧透映射 (V. E,F) 有两种不同的弧透嵌入、E,F)(V,E,F 分别为顶点集、边集和面集),即如果 |az| 有限,则为 G 旋转图;如果 |zza| 有限,则为 G 双旋转图。G 旋转图可以表示为 G 的余集几何,扩展了余集图的概念。然而 G-bi-rotary 映射没有这样的表示法,除了面与边之间的发生率之外,还必须指定面边界循环。此外,还给出了非简单图的旗正则图(V,E,F)的余集几何构造。对于所有这些构造,都证明了当给定的群忠实地作用于 V∪F 时,面边界循环正是简单循环。文中给出了与 n 维超立方体和彼得森图有关的图的示例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Locally finite vertex-rotary maps and coset graphs with finite valency and finite edge multiplicity

A well-known theorem of Sabidussi shows that a simple G-arc-transitive graph can be represented as a coset graph for the group G. This pivotal result is the standard way to turn problems about simple arc-transitive graphs into questions about groups. In this paper, the Sabidussi representation is extended to arc-transitive, not necessarily simple graphs which satisfy a local-finiteness condition: namely graphs with finite valency and finite edge-multiplicity. The construction yields a G-arc-transitive coset graph Cos(G,H,J), where H,J are stabilisers in G of a vertex and incident edge, respectively. A first major application is presented concerning arc-transitive maps on surfaces: given a group G=a,z with |z|=2 and |a| finite, the coset graph Cos(G,a,z) is shown, under suitable finiteness assumptions, to have exactly two different arc-transitive embeddings as a G-arc-transitive map (V,E,F) (with V,E,F the sets of vertices, edges and faces, respectively), namely, a G-rotary map if |az| is finite, and a G-bi-rotary map if |zza| is finite. The G-rotary map can be represented as a coset geometry for G, extending the notion of a coset graph. However the G-bi-rotary map does not have such a representation, and the face boundary cycles must be specified in addition to incidences between faces and edges. In addition a coset geometry construction is given of a flag-regular map (V,E,F) for non necessarily simple graphs. For all of these constructions it is proved that the face boundary cycles are simple cycles precisely when the given group acts faithfully on VF. Illustrative examples are given for graphs related to the n-dimensional hypercubes and the Petersen graph.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
2.70
自引率
14.30%
发文量
99
审稿时长
6-12 weeks
期刊介绍: The Journal of Combinatorial Theory publishes original mathematical research dealing with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series B is concerned primarily with graph theory and matroid theory and is a valuable tool for mathematicians and computer scientists.
期刊最新文献
Some results and problems on tournament structure Ramsey numbers of bounded degree trees versus general graphs Tree amalgamations and quasi-isometries Clustered coloring of (path + 2K1)-free graphs on surfaces A counterexample to the coarse Menger conjecture
×
引用
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