论图着色中支配类的最大数目

离散数学期刊(英文) Pub Date : 2016-03-31 DOI:10.4236/OJDM.2016.62006

B. Zhou

{"title":"论图着色中支配类的最大数目","authors":"B. Zhou","doi":"10.4236/OJDM.2016.62006","DOIUrl":null,"url":null,"abstract":"We investigate the dominating-c-color number,, of a graph G. That is the maximum number of color classes that are also dominating when G is colored using colors. We show that where is the join of G and . This result allows us to construct classes of graphs such that and thus provide some information regarding two questions raised in [1] and [2].","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":"06 1","pages":"70-73"},"PeriodicalIF":0.0000,"publicationDate":"2016-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"On the Maximum Number of Dominating Classes in Graph Coloring\",\"authors\":\"B. Zhou\",\"doi\":\"10.4236/OJDM.2016.62006\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate the dominating-c-color number,, of a graph G. That is the maximum number of color classes that are also dominating when G is colored using colors. We show that where is the join of G and . This result allows us to construct classes of graphs such that and thus provide some information regarding two questions raised in [1] and [2].\",\"PeriodicalId\":61712,\"journal\":{\"name\":\"离散数学期刊(英文)\",\"volume\":\"06 1\",\"pages\":\"70-73\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-03-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"离散数学期刊(英文)\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.4236/OJDM.2016.62006\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"离散数学期刊(英文)","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.4236/OJDM.2016.62006","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

我们研究了图G的占主导地位的c色数，这是当用颜色给G上色时占主导地位的颜色类的最大数量。我们证明了G和的连接在哪里。这个结果允许我们构造这样的图类，从而提供关于[1]和[2]中提出的两个问题的一些信息。

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

查看原文本刊更多论文

On the Maximum Number of Dominating Classes in Graph Coloring

We investigate the dominating-c-color number,, of a graph G. That is the maximum number of color classes that are also dominating when G is colored using colors. We show that where is the join of G and . This result allows us to construct classes of graphs such that and thus provide some information regarding two questions raised in [1] and [2].

求助全文

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

来源期刊

离散数学期刊(英文)

自引率

0.00%

发文量

127