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...
Sábháilte in:
Príomhchruthaitheoirí: | , , , |
---|---|
Rannpháirtithe: | |
Formáid: | EJournal Article |
Foilsithe / Cruthaithe: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2018-10-10.
|
Ábhair: | |
Rochtain ar líne: | Get Fulltext Get Fulltext Get Fulltext |
Clibeanna: |
Cuir clib leis
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!
|
Ar líne
Get FulltextGet Fulltext
Get Fulltext
3rd Floor Main Library
Gairmuimhir: |
A1234.567 |
---|---|
Cóip 1 | Ar fáil |