3-difference cordiality of some corona graphs
Abstract Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map where k is an integer 2 ≤ k ≤ p. For each edge uv, assign the label |f (u) − f (v)|. f is called k-difference cordial labeling of G if |vf (i) − vf (j)| ≤ 1 and |e...
Saved in:
| Main Authors: | , , |
|---|---|
| Language: | English |
| Published: |
Universidad Católica del Norte, Departamento de Matemáticas
2019
|
| Subjects: | |
| Online Access: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172019000100083 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|