Equitable Strong Edge Coloring of the Joins of Paths and Cycles

被引：0

作者：

Tao WANG 1

2.LMIB and Department of Mathematics

3.Department of Mathematics

机构：

来源：

Journal of Mathematical Research with Applications | 2012年 / 01期

基金：

中央高校基本科研业务费专项资金资助; 中国国家自然科学基金;

关键词：

adjacent strong edge coloring; equitable edge coloring; joins of paths; cycle; maximum degree; chromatic index;

D O I：

暂无

中图分类号：

O157.5 [图论];

学科分类号：

070104 ;

摘要：

For a proper edge coloring c of a graph G,if the sets of colors of adjacent vertices are distinct,the edge coloring c is called an adjacent strong edge coloring of G.Let c i be the number of edges colored by i.If |c i c j | ≤ 1 for any two colors i and j,then c is an equitable edge coloring of G.The coloring c is an equitable adjacent strong edge coloring of G if it is both adjacent strong edge coloring and equitable edge coloring.The least number of colors of such a coloring c is called the equitable adjacent strong chromatic index of G.In this paper,we determine the equitable adjacent strong chromatic index of the joins of paths and cycles.Precisely,we show that the equitable adjacent strong chromatic index of the joins of paths and cycles is equal to the maximum degree plus one or two.

引用

页码：11 / 18

页数：8