识别 X$ 连接的二元组图和二元组图的自形群

arXiv - MATH - Combinatorics Pub Date : 2024-09-17 DOI:arxiv-2409.11092

Rachel Barber, Ted Dobson, Gregory Robson

{"title":"识别 X$ 连接的二元组图和二元组图的自形群","authors":"Rachel Barber, Ted Dobson, Gregory Robson","doi":"arxiv-2409.11092","DOIUrl":null,"url":null,"abstract":"We examine bicoset digraphs and their natural properties from the point of\nview of symmetry. We then consider connected bicoset digraphs that are\n$X$-joins with collections of empty graphs, and show that their automorphism\ngroups can be obtained from their natural irreducible quotients. We then show\nthat such digraphs can be recognized from their connection sets.","PeriodicalId":501407,"journal":{"name":"arXiv - MATH - Combinatorics","volume":"21 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Recognizing bicoset digraphs which are $X$-joins and automorphism groups of bicoset digraphs\",\"authors\":\"Rachel Barber, Ted Dobson, Gregory Robson\",\"doi\":\"arxiv-2409.11092\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We examine bicoset digraphs and their natural properties from the point of\\nview of symmetry. We then consider connected bicoset digraphs that are\\n$X$-joins with collections of empty graphs, and show that their automorphism\\ngroups can be obtained from their natural irreducible quotients. We then show\\nthat such digraphs can be recognized from their connection sets.\",\"PeriodicalId\":501407,\"journal\":{\"name\":\"arXiv - MATH - Combinatorics\",\"volume\":\"21 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - MATH - Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.11092\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.11092","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们从对称性的角度研究了二元组数图及其自然属性。然后，我们考虑了具有空图形集合的$X$连接的连接二元组数图，并证明它们的自形群可以从它们的自然不可还原商中获得。然后，我们证明可以从连接集中识别出这类数图。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Recognizing bicoset digraphs which are $X$-joins and automorphism groups of bicoset digraphs

We examine bicoset digraphs and their natural properties from the point of view of symmetry. We then consider connected bicoset digraphs that are $X$-joins with collections of empty graphs, and show that their automorphism groups can be obtained from their natural irreducible quotients. We then show that such digraphs can be recognized from their connection sets.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

arXiv - MATH - Combinatorics

自引率

0.00%

发文量