@ARTICLE{Lau, author = {Shiu, W.-Ch. and Lau, G.-Ch. and Ng, H.-K. and }, title = {Edge-coloring Vertex-weightings of Graphs}, volume = {16}, number = {1}, abstract ={Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(e')$ for any two adjacent edges $e$ and $e'$. Denote by $mu'(G)$ the minimum $k$ for $G$ to admit an edge-coloring $k$-vertex weightings. In this paper, we determine $mu'(G)$ for some classes of graphs. }, URL = {http://ijmsi.ir/article-1-1033-en.html}, eprint = {http://ijmsi.ir/article-1-1033-en.pdf}, journal = {Iranian Journal of Mathematical Sciences and Informatics}, doi = {}, year = {2021} }