Odd Vertex Equitable Even Labeling of Cycle Related Graphs
ABSTRACT Let G be a graph with p vertices and q edges and A = {1, 3, ..., q} if q is odd or A = {1, 3, ..., q + 1} if q is even. A graph G is said to admit an odd vertex equitable even labeling if there exists a vertex labeling f : (G) → A that induces an edge labeling f∗ defined...
Guardado en:
| Autores principales: | , |
|---|---|
| Lenguaje: | English |
| Publicado: |
Universidad de La Frontera. Departamento de Matemática y Estadística.
2018
|
| Materias: | |
| Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0719-06462018000200013 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | ABSTRACT Let G be a graph with p vertices and q edges and A = {1, 3, ..., q} if q is odd or A = {1, 3, ..., q + 1} if q is even. A graph G is said to admit an odd vertex equitable even labeling if there exists a vertex labeling f : (G) → A that induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv such that for all a and b in A, |vf(a) − vf(b)| ≤ 1 and the induced edge labels are 2, 4, ..., 2q where vf(a) be the number of vertices v with f(v) = a for a ∈ A. A graph that admits an odd vertex equitable even labeling is called an odd vertex equitable even graph. Here, we prove that the subdivision of double triangular snake (S(D(Tn))), subdivision of double quadrilateral snake (S(D(Qn))), DA(Qm) ⊙ nK1 and DA(Tm) ⊙ nK1 are odd vertex equitable even graphs. |
|---|