产品图形的主导着色

IF 0.9 4区数学 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Journal of Combinatorial Optimization Pub Date : 2023-11-10 DOI:10.1007/s10878-023-01094-7

Minhui Li, Shumin Zhang, Chengfu Ye

{"title":"产品图形的主导着色","authors":"Minhui Li, Shumin Zhang, Chengfu Ye","doi":"10.1007/s10878-023-01094-7","DOIUrl":null,"url":null,"abstract":"The dominated coloring (dom-coloring) of a graph G is a proper coloring such that each color class is dominated by at least one vertex. The dominated chromatic number (dom-chromatic number) of G is the minimum number of color classes among all dominated colorings of G, denoted by \\(\\chi _{\\text {dom}}(G)\\). In this paper, we study the dominated coloring of Cartesian product, direct product, lexicographic product and strong product of some graphs.\n","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2023-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dominated coloring in product graphs\",\"authors\":\"Minhui Li, Shumin Zhang, Chengfu Ye\",\"doi\":\"10.1007/s10878-023-01094-7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The dominated coloring (dom-coloring) of a graph G is a proper coloring such that each color class is dominated by at least one vertex. The dominated chromatic number (dom-chromatic number) of G is the minimum number of color classes among all dominated colorings of G, denoted by \\\\(\\\\chi _{\\\\text {dom}}(G)\\\\). In this paper, we study the dominated coloring of Cartesian product, direct product, lexicographic product and strong product of some graphs.\\n\",\"PeriodicalId\":50231,\"journal\":{\"name\":\"Journal of Combinatorial Optimization\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2023-11-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Optimization\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10878-023-01094-7\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-023-01094-7","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}

引用次数: 0

摘要

图G的支配着色(dom-着色)是一种适当的着色，使得每个颜色类至少被一个顶点支配。G的支配色数(dom-chromatic number)是G的所有支配色中最小的色类数，记为\(\chi _{\text {dom}}(G)\)。本文研究了一些图的笛卡尔积、直积、字典积和强积的支配着色。

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

查看原文本刊更多论文

Dominated coloring in product graphs

The dominated coloring (dom-coloring) of a graph G is a proper coloring such that each color class is dominated by at least one vertex. The dominated chromatic number (dom-chromatic number) of G is the minimum number of color classes among all dominated colorings of G, denoted by \(\chi _{\text {dom}}(G)\). In this paper, we study the dominated coloring of Cartesian product, direct product, lexicographic product and strong product of some graphs.

求助全文

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

来源期刊

Journal of Combinatorial Optimization 数学-计算机：跨学科应用

CiteScore

2.00

自引率

10.00%

发文量

审稿时长

6 months

期刊介绍： The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering. The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.