发布求助
文献互助 智能选刊 最新文献

笛卡尔积图的可区分颜色的数目

IF 0.6 4区 数学 Q3 MATHEMATICS
Quaestiones Mathematicae Pub Date : 2023-11-30 DOI:10.2989/16073606.2023.2274580
Saeid Alikhani, Mohammad H. Shekarriz
{"title":"笛卡尔积图的可区分颜色的数目","authors":"Saeid Alikhani, Mohammad H. Shekarriz","doi":"10.2989/16073606.2023.2274580","DOIUrl":null,"url":null,"abstract":"A vertex coloring is called distinguishing if the identity is the only automorphism that can preserve it. The distinguishing threshold θ(G) of a graph G is the minimum number of colors k required t...","PeriodicalId":49652,"journal":{"name":"Quaestiones Mathematicae","volume":"8 6 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2023-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The number of distinguishing colorings of a Cartesian product graph\",\"authors\":\"Saeid Alikhani, Mohammad H. Shekarriz\",\"doi\":\"10.2989/16073606.2023.2274580\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A vertex coloring is called distinguishing if the identity is the only automorphism that can preserve it. The distinguishing threshold θ(G) of a graph G is the minimum number of colors k required t...\",\"PeriodicalId\":49652,\"journal\":{\"name\":\"Quaestiones Mathematicae\",\"volume\":\"8 6 1\",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Quaestiones Mathematicae\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.2989/16073606.2023.2274580\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quaestiones Mathematicae","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.2989/16073606.2023.2274580","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

如果恒等式是唯一能保持它的自同构，则顶点着色称为区分着色。图G的区分阈值θ(G)是所需颜色k的最小个数t…
本文章由计算机程序翻译，如有差异，请以英文原文为准。
分享
查看原文 本刊更多论文
The number of distinguishing colorings of a Cartesian product graph
A vertex coloring is called distinguishing if the identity is the only automorphism that can preserve it. The distinguishing threshold θ(G) of a graph G is the minimum number of colors k required t...
求助全文
通过发布文献求助，成功后即可免费获取论文全文。 去求助
来源期刊
Quaestiones Mathematicae
Quaestiones Mathematicae 数学-数学
CiteScore
1.70
自引率
0.00%
发文量
121
审稿时长
>12 weeks
期刊介绍： Quaestiones Mathematicae is devoted to research articles from a wide range of mathematical areas. Longer expository papers of exceptional quality are also considered. Published in English, the journal receives contributions from authors around the globe and serves as an important reference source for anyone interested in mathematics.
×
引用
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学术官方微信