Title of article
The edge-labeling and vertex-colors of Kn
Author/Authors
Alaeiyan, Mohammad hadi iran university of science and technology - Department of Computer Enginering, تهران, ايران
From page
1
To page
3
Abstract
A labeling of the edges of a graph is called vertex-coloring if the labeled degrees of the vertices yield a proper coloring of the graph. In this paper, we show that such a labeling is possible from the label set 1,2,3 for the complete graph Kn, n ≥ 3.
Keywords
Edge , labeling , Vertex , coloring , Complete graph
Journal title
Mathematical Sciences
Journal title
Mathematical Sciences
Record number
2569026
Link To Document