Strongly*-2 Divisor Cordial Labeling of Cycle Related Graphs
A strongly*-2 divisor cordial labeling of a graph G with the vertex set V (G) is a bijection a : V (G) → {1, 2, 3, ..., |V (G)|} such that each edge cd assigned the label 1 if the lower integal value of sum of a(c), a(d) and a(c)a(d) divided by 2 is odd and 0 if lower integal value of sum of a(c), a...
I tiakina i:
| Ngā kaituhi matua: | , |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
Accademia Piceno Aprutina dei Velati
2023-12-01
|
| Rangatū: | Ratio Mathematica |
| Ngā marau: | |
| Urunga tuihono: | http://eiris.it/ojs/index.php/ratiomathematica/article/view/1299 |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|