Even vertex equitable even labeling for snake related graphs
Abstract Let G be a graph with p vertices and q edges and A = {0,2,4,···, q+1} if q is odd or A = {0,2,4,···,q} if q is even. A graph G is said to be an even vertex equitable even labeling if there exists a vertex labeling f : V (G) → A that induces an edge labeling f∗ de@...
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Langue: | English |
| Publié: |
Universidad Católica del Norte, Departamento de Matemáticas
2019
|
| Sujets: | |
| Accès en ligne: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172019000100177 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|