On total edge product cordial labeling of fullerenes
For a simple graph G = (V, E) this paper deals with the existence of an edge labeling φ : E(G) → {0, 1, ..., k − 1}, 2 ≤ k ≤ ∣E(G)∣, which induces a vertex labeling φ * : V(G) → {0, 1, ..., k − 1} in such a way that for each vertex v, assigns the label $\varphi(e_1)\cdot\varphi(e_2)\cdot\ldots\cdot...
Saved in:
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | EJournal Article |
| Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2018-10-10.
|
| Subjects: | |
| Online Access: | Get Fulltext Get Fulltext Get Fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!