New results on vertex equitable labeling
The concept of vertex equitable labeling was introduced in [9]. A graph $G$ is said to be vertex equitable if there exists a vertex labeling $f$ such that for all $a$ and $b$ in $A$, $\left|v_f(a)-v_f(b)\right|\leq1$ and the induced edge labels are $1, 2, 3,\cdots, q$. A graph $G$ is said to be a...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yildiz Technical University
2016-05-01
|
| Series: | Journal of Algebra Combinatorics Discrete Structures and Applications |
| Online Access: | http://dergipark.ulakbim.gov.tr/jacodesmath/article/view/5000184291 |