Jagannathan M, Vernold Vivin J, Veninstine Vivik J
{"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}
引用次数: 0
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
