Further results on edge irregularity strength of graphs
<p>A vertex $k$-labelling $\phi:V(G)\longrightarrow \{1,2,\ldots,k\}$ is called irregular $k$-labeling of the graph $G$ if for every two different edges $e$ and $f$, there is $w_{\phi}(e)\neq w_{\phi}(f)$; where the weight of an edge is given by $e=xy\in E(G)$ is $w_{\phi}(xy)=\phi(x)+\phi(y)$...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
InaCombS; Universitas Jember; dan Universitas Indonesia
2017-08-01
|
| Series: | Indonesian Journal of Combinatorics |
| Subjects: | |
| Online Access: | http://www.ijc.or.id/index.php/ijc/article/view/22 |