On total edge product cordial labeling of fullerenes
<p>For a simple graph <span class="math"><em>G</em> = (<em>V</em>, <em>E</em>)</span> this paper deals with the existence of an edge labeling <span class="math"><em>φ</em> : <em>E</em>(<em>G</em>) → {0, 1, …, <em>k</em> − 1}</span>, <span class="math">2 ≤ <em>k</em> ≤ ∣<em>E</em>(<em>G</em>)∣</span>...
Furkejuvvon:
| Váldodahkkit: | , , , |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2018-10-01
|
| Ráidu: | Electronic Journal of Graph Theory and Applications |
| Fáttát: | |
| Liŋkkat: | http://www.ejgta.org/index.php/ejgta/article/view/395 |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|