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...
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Langue: | English |
| Publié: |
Universidad de La Frontera. Departamento de Matemática y Estadística.
2018
|
| Sujets: | |
| Accès en ligne: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0719-06462018000200013 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|