一类轮图分裂图的公平边着色

4区数学 Q4 Mathematics

Ars Combinatoria Pub Date : 2023-07-27 DOI:10.61091/ars156-05

Jagannathan M, Vernold Vivin J, Veninstine Vivik J

{"title":"一类轮图分裂图的公平边着色","authors":"Jagannathan M, Vernold Vivin J, Veninstine Vivik J","doi":"10.61091/ars156-05","DOIUrl":null,"url":null,"abstract":"The coloring of all the edges of a graph \\(G\\) with the minimum number of colors, such that the adjacent edges are allotted a different color is known as the proper edge coloring. It is said to be equitable, if the number of edges in any two color classes differ by atmost one. In this paper, we obtain the equitable edge coloring of splitting graph of \\(W_n\\), \\(DW_n\\) and \\(G_n\\) by determining its edge chromatic number.","PeriodicalId":55575,"journal":{"name":"Ars Combinatoria","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Equitable Edge Coloring of Splitting Graph of Some Classes of Wheel Graphs\",\"authors\":\"Jagannathan M, Vernold Vivin J, Veninstine Vivik J\",\"doi\":\"10.61091/ars156-05\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The coloring of all the edges of a graph \\\\(G\\\\) with the minimum number of colors, such that the adjacent edges are allotted a different color is known as the proper edge coloring. It is said to be equitable, if the number of edges in any two color classes differ by atmost one. In this paper, we obtain the equitable edge coloring of splitting graph of \\\\(W_n\\\\), \\\\(DW_n\\\\) and \\\\(G_n\\\\) by determining its edge chromatic number.\",\"PeriodicalId\":55575,\"journal\":{\"name\":\"Ars Combinatoria\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-07-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ars Combinatoria\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.61091/ars156-05\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ars Combinatoria","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.61091/ars156-05","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 0

摘要

用最少的颜色数给图\(G\)的所有边上色，使相邻的边被分配不同的颜色，称为适当的边上色。如果任意两个颜色类中的边数相差不超过一条，则称其为公平的。本文通过确定\(W_n\)、\(DW_n\)和\(G_n\)的分裂图的边色数，得到了分裂图的均匀边着色。

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

查看原文本刊更多论文

Equitable Edge Coloring of Splitting Graph of Some Classes of Wheel Graphs

The coloring of all the edges of a graph \(G\) with the minimum number of colors, such that the adjacent edges are allotted a different color is known as the proper edge coloring. It is said to be equitable, if the number of edges in any two color classes differ by atmost one. In this paper, we obtain the equitable edge coloring of splitting graph of \(W_n\), \(DW_n\) and \(G_n\) by determining its edge chromatic number.

求助全文

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

来源期刊

Ars Combinatoria 数学-数学

CiteScore

0.30

自引率

0.00%

发文量

审稿时长

5 months

期刊介绍： Information not localized