强序列阿贝尔群

Art Discret. Appl. Math. Pub Date : 2020-07-22 DOI:10.26493/2590-9770.1291.c54

B. Alspach, Georgina Liversidge

{"title":"强序列阿贝尔群","authors":"B. Alspach, Georgina Liversidge","doi":"10.26493/2590-9770.1291.c54","DOIUrl":null,"url":null,"abstract":"A group is strongly sequenceable if every connected Cayley digraph on the group admits an orthogonal directed cycle or an orthogonal directed path. This paper deals with the problem of whether finite abelian groups are strongly sequenceable. A method based on posets is used to show that if the connection set for a Cayley digraph on an abelian group has cardinality at most nine, then the digraph admits either an orthogonal directed path or an orthogonal directed cycle.","PeriodicalId":236892,"journal":{"name":"Art Discret. Appl. Math.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":"{\"title\":\"On strongly sequenceable abelian groups\",\"authors\":\"B. Alspach, Georgina Liversidge\",\"doi\":\"10.26493/2590-9770.1291.c54\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A group is strongly sequenceable if every connected Cayley digraph on the group admits an orthogonal directed cycle or an orthogonal directed path. This paper deals with the problem of whether finite abelian groups are strongly sequenceable. A method based on posets is used to show that if the connection set for a Cayley digraph on an abelian group has cardinality at most nine, then the digraph admits either an orthogonal directed path or an orthogonal directed cycle.\",\"PeriodicalId\":236892,\"journal\":{\"name\":\"Art Discret. Appl. Math.\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-07-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Art Discret. Appl. Math.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.26493/2590-9770.1291.c54\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Art Discret. Appl. Math.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.26493/2590-9770.1291.c54","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 20

摘要

如果群上的所有连通Cayley有向图都存在正交有向环或正交有向路径，则群是强可序的。本文讨论了有限阿贝尔群是否强可序列的问题。用一种基于偏序集的方法证明了在阿贝群上Cayley有向图的连接集的基数不超过9，则该有向图要么存在正交有向路径，要么存在正交有向环。

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

查看原文本刊更多论文

On strongly sequenceable abelian groups

A group is strongly sequenceable if every connected Cayley digraph on the group admits an orthogonal directed cycle or an orthogonal directed path. This paper deals with the problem of whether finite abelian groups are strongly sequenceable. A method based on posets is used to show that if the connection set for a Cayley digraph on an abelian group has cardinality at most nine, then the digraph admits either an orthogonal directed path or an orthogonal directed cycle.

求助全文

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

来源期刊

Art Discret. Appl. Math.

自引率

0.00%

发文量