Edge Coloring by Total Labelings of 4-regular Circulant Graphs.
Electronic Notes in Discrete Mathematics(2013)
摘要
Edge-coloring total k-labeling of a connected graph G is an assignment f of non negative integers to the vertices and edges of G such that two adjacent edges e=uv and e′=uv′ of G have different weights. The weight of an edge uv is defined by:w(e=uv)=f(u)+f(v)+f(e). In this paper, we study the chromatic number of the edge coloring by total labeling of 4-regular circulant graphs Cn(1,k).
更多查看译文
关键词
Edge coloring,total labeling,4-regular circulant graphs
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络