Note on edge irregular reflexive labelings of graphs
For a graph G, an edge labeling fe:E(G)→{1,2,…,ke}and a vertex labeling fv:V(G)→{0,2,4,…,2kv}are called total k-labeling, where k=max{ke,2kv}. The total k-labeling is called an edge irregular reflexive k-labeling of the graph G, if for every two different edges xy and x′y′of G, one has wt(xy)=fv(x)+...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2019-08-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S0972860017301238 |