当前位置: X-MOL 学术Discret. Math. › 论文详情
On symmetries of edge and vertex colourings of graphs
Discrete Mathematics ( IF 0.728 ) Pub Date : 2020-05-22 , DOI: 10.1016/j.disc.2020.111959
Florian Lehner; Simon M. Smith

Let c and c′ be edge or vertex colourings of a graph G. The stabiliser of c is the set of automorphisms of G that preserve the colouring. We say that c′ is less symmetric than c if the stabiliser of c′ is contained in the stabiliser of c. We show that if G is not a bicentred tree, then for every vertex colouring of G there is a less symmetric edge colouring with the same number of colours. On the other hand, if T is a tree, then for every edge colouring there is a less symmetric vertex colouring with the same number of colours. Our results can be used to characterise those graphs whose distinguishing index is larger than their distinguishing number.
更新日期:2020-05-22

 

全部期刊列表>>
如何通过Nature平台传播科研成果
跟Nature、Science文章学绘图
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
中洪博元
ACS材料视界
x-mol收录
南开大学
朱守非
廖良生
南方科技大学
西湖大学
伊利诺伊大学香槟分校
徐明华
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug