双发电机圆周图的对称参数

IF 0.6 4区数学 Q4 MATHEMATICS, APPLIED

Annals of Combinatorics Pub Date : 2024-07-26 DOI:10.1007/s00026-024-00709-y

Sally Cockburn, Sarah Loeb

{"title":"双发电机圆周图的对称参数","authors":"Sally Cockburn, Sarah Loeb","doi":"10.1007/s00026-024-00709-y","DOIUrl":null,"url":null,"abstract":"<div><p>The derived graph of a voltage graph consisting of a single vertex and two loops of different voltages is a circulant graph with two generators. We characterize the automorphism groups of connected, two-generator circulant graphs, and give their determining and distinguishing number, and when relevant, their cost of 2-distinguishing. We do the same for the subdivisions of connected, two-generator circulant graphs obtained by replacing one loop in the voltage graph with a directed cycle.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"28 4","pages":"1093 - 1117"},"PeriodicalIF":0.6000,"publicationDate":"2024-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Symmetry Parameters of Two-Generator Circulant Graphs\",\"authors\":\"Sally Cockburn, Sarah Loeb\",\"doi\":\"10.1007/s00026-024-00709-y\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The derived graph of a voltage graph consisting of a single vertex and two loops of different voltages is a circulant graph with two generators. We characterize the automorphism groups of connected, two-generator circulant graphs, and give their determining and distinguishing number, and when relevant, their cost of 2-distinguishing. We do the same for the subdivisions of connected, two-generator circulant graphs obtained by replacing one loop in the voltage graph with a directed cycle.</p></div>\",\"PeriodicalId\":50769,\"journal\":{\"name\":\"Annals of Combinatorics\",\"volume\":\"28 4\",\"pages\":\"1093 - 1117\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2024-07-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annals of Combinatorics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00026-024-00709-y\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00026-024-00709-y","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 0

摘要

由一个顶点和两个不同电压的回路组成的电压图的派生图是一个具有两个发电机的环状图。我们描述了连通的双发电机环形图的自形群的特征，并给出了它们的确定数和区分数，以及相关情况下的二区分代价。我们对通过将电压图中的一个循环替换为有向循环而得到的连通双发电机环形图的细分也做了同样的处理。

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

Symmetry Parameters of Two-Generator Circulant Graphs

查看原文本刊更多论文

Symmetry Parameters of Two-Generator Circulant Graphs

The derived graph of a voltage graph consisting of a single vertex and two loops of different voltages is a circulant graph with two generators. We characterize the automorphism groups of connected, two-generator circulant graphs, and give their determining and distinguishing number, and when relevant, their cost of 2-distinguishing. We do the same for the subdivisions of connected, two-generator circulant graphs obtained by replacing one loop in the voltage graph with a directed cycle.

求助全文

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

来源期刊

Annals of Combinatorics 数学-应用数学

CiteScore

1.00

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： Annals of Combinatorics publishes outstanding contributions to combinatorics with a particular focus on algebraic and analytic combinatorics, as well as the areas of graph and matroid theory. Special regard will be given to new developments and topics of current interest to the community represented by our editorial board. The scope of Annals of Combinatorics is covered by the following three tracks: Algebraic Combinatorics: Enumerative combinatorics, symmetric functions, Schubert calculus / Combinatorial Hopf algebras, cluster algebras, Lie algebras, root systems, Coxeter groups / Discrete geometry, tropical geometry / Discrete dynamical systems / Posets and lattices Analytic and Algorithmic Combinatorics: Asymptotic analysis of counting sequences / Bijective combinatorics / Univariate and multivariable singularity analysis / Combinatorics and differential equations / Resolution of hard combinatorial problems by making essential use of computers / Advanced methods for evaluating counting sequences or combinatorial constants / Complexity and decidability aspects of combinatorial sequences / Combinatorial aspects of the analysis of algorithms Graphs and Matroids: Structural graph theory, graph minors, graph sparsity, decompositions and colorings / Planar graphs and topological graph theory, geometric representations of graphs / Directed graphs, posets / Metric graph theory / Spectral and algebraic graph theory / Random graphs, extremal graph theory / Matroids, oriented matroids, matroid minors / Algorithmic approaches