Vertex equitable labeling of union of cyclic snake related graphs
Let G be a graph with p vértices and q edges and A = {0,1, 2,..., q/2}. A vertex labeling f : V(G) → A induces an edge labeling f * defined by f *(uv) = f (u) + f (v) for all edges uv. For a ∈ A, let v f (a) be the number of vertices v with f (v) = a. A graph G is said to be vert...
Saved in:
| Main Authors: | , , |
|---|---|
| Language: | English |
| Published: |
Universidad Católica del Norte, Departamento de Matemáticas
2016
|
| Subjects: | |
| Online Access: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172016000200003 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|