G × Z_2的对称着色

IF 0.4 Q4 MATHEMATICS
Jabulani Phakathi, Yevhen Zelenyuk, Yuliya Zelenyuk
{"title":"G × Z_2的对称着色","authors":"Jabulani Phakathi, Yevhen Zelenyuk, Yuliya Zelenyuk","doi":"10.5614/ejgta.2023.11.2.3","DOIUrl":null,"url":null,"abstract":"Let G be a finite group and let r ∈ N . An r -coloring of G is any mapping χ : G → { 1 , . . . , r } . A coloring χ is symmetric if there is g ∈ G such that χ ( gx − 1 g ) = χ ( x ) for every x ∈ G . We show that if f ( r ) is the polynomial representing the number of symmetric r -colorings of G , then the number of symmetric r -colorings of G × Z 2 is f ( r 2 )","PeriodicalId":43771,"journal":{"name":"Electronic Journal of Graph Theory and Applications","volume":"61 11","pages":"0"},"PeriodicalIF":0.4000,"publicationDate":"2023-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Symmetric colorings of G × Z_2\",\"authors\":\"Jabulani Phakathi, Yevhen Zelenyuk, Yuliya Zelenyuk\",\"doi\":\"10.5614/ejgta.2023.11.2.3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let G be a finite group and let r ∈ N . An r -coloring of G is any mapping χ : G → { 1 , . . . , r } . A coloring χ is symmetric if there is g ∈ G such that χ ( gx − 1 g ) = χ ( x ) for every x ∈ G . We show that if f ( r ) is the polynomial representing the number of symmetric r -colorings of G , then the number of symmetric r -colorings of G × Z 2 is f ( r 2 )\",\"PeriodicalId\":43771,\"journal\":{\"name\":\"Electronic Journal of Graph Theory and Applications\",\"volume\":\"61 11\",\"pages\":\"0\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2023-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Journal of Graph Theory and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5614/ejgta.2023.11.2.3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Journal of Graph Theory and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5614/ejgta.2023.11.2.3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

本文章由计算机程序翻译,如有差异,请以英文原文为准。
Symmetric colorings of G × Z_2
Let G be a finite group and let r ∈ N . An r -coloring of G is any mapping χ : G → { 1 , . . . , r } . A coloring χ is symmetric if there is g ∈ G such that χ ( gx − 1 g ) = χ ( x ) for every x ∈ G . We show that if f ( r ) is the polynomial representing the number of symmetric r -colorings of G , then the number of symmetric r -colorings of G × Z 2 is f ( r 2 )
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.20
自引率
28.60%
发文量
48
审稿时长
52 weeks
期刊介绍: We publish research articles written in English in all areas of modern graph theory together with applications to other fields of mathematics, computer science and other sciences.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信