E-Cordial Labeling for Cupola Graph Cu(3, b, n)
Graph labeling is a map that maps graph elements such as vertices, edges, vertices, and edges to a set of numbers. A graph labeling is named e-cordial if there is a binary mapping f:E(G)→{0,1} which induces the vertex labeling defined by g(v)=Ʃ_{uvϵE(G)}f(uv)(mod 2), so that it satisfies the absolut...
| Hlavní autoři: | , , |
|---|---|
| Médium: | Článek |
| Jazyk: | English |
| Vydáno: |
UIN Syarif Hidayatullah
2022-04-01
|
| Edice: | InPrime |
| Témata: | |
| On-line přístup: | https://journal.uinjkt.ac.id/index.php/inprime/article/view/24210 |