Sum divisor cordial graphs
A sum divisor cordial labeling of a graph G with vertex set V is a bijection f from V (G) to {1, 2, ..., |V (G)|} such that an edge uv is assigned the label 1 if 2 divides f (u) + f (v) and 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most...
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Langue: | English |
| Publié: |
Universidad Católica del Norte, Departamento de Matemáticas
2016
|
| Sujets: | |
| Accès en ligne: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172016000100008 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|