当前位置:
X-MOL 学术
›
Discret. Math.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Genus, thickness and crossing number of graphs encoding the generating properties of finite groups
Discrete Mathematics ( IF 0.7 ) Pub Date : 2021-01-14 , DOI: 10.1016/j.disc.2021.112289 Cristina Acciarri , Andrea Lucchini
中文翻译:
编码有限群生成性质的图的属,粗度和交叉数
更新日期:2021-01-14
Discrete Mathematics ( IF 0.7 ) Pub Date : 2021-01-14 , DOI: 10.1016/j.disc.2021.112289 Cristina Acciarri , Andrea Lucchini
Assume that is a finite group and let and be non-negative integers. We define an undirected graph whose vertices correspond to the elements of and in which two tuples and are adjacent if and only if Our aim is to estimate the genus, the thickness and the crossing number of the graph when and are positive integers, giving explicit lower bounds on these invariants in terms of
中文翻译:
编码有限群生成性质的图的属,粗度和交叉数
假使,假设 是一个有限的群,让 和 是非负整数。我们定义一个无向图 其顶点对应于的元素 并且其中两个元组 和 在且仅当 我们的目的是估计图的属,粗细和相交数 什么时候 和 是正整数,就这些不变量给出了明确的下界