Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Khairannisa Al Azizu"'
Publikováno v:
Indonesian Journal of Combinatorics, Vol 5, Iss 1, Pp 11-16 (2021)
Let H be a branched-prism graph, denoted by H = (Cm x P2) ⊙ Ǩn for odd m, m ≥ 3 and n ≥ 1. This paper considers about the existence of the super (a,d)-edge antimagic total labeling of H, for some positive integer a and some non-negative intege
Externí odkaz:
https://doaj.org/article/e5e5e9aeb02044c1ade5b490ae795244
Publikováno v:
Indonesian Journal of Combinatorics, Vol 5, Iss 1, Pp 11-16 (2021)
Let H be a branched-prism graph, denoted by H = (Cm x P2) ⊙ Ǩn for odd m, m ≥ 3 and n ≥ 1. This paper considers about the existence of the super (a,d)-edge antimagic total labeling of H, for some positive integer a and some non-negative intege
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b239776d770db562080ec3bf36ed1dee
http://ijc.or.id/index.php/ijc/article/view/120
http://ijc.or.id/index.php/ijc/article/view/120
Autor:
Khairannisa, Al Azizu
Suatu pemetaan f : V (G)∪E(G) → {1,2,··· ,|V (G)|+|E(G)|} dikatakan pelabelan total (a,d)−sisi anti ajaib dari graf G jika himpunan bobot sisi di G, notasikan W = {f(x) + f(y) + f(xy)|xy ∈ E(G)} dapat dituliskan sebagai W = {a,a+d,··· ,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______5884::d503a7d046f9ad3f4036ce09f8e10f2d
http://scholar.unand.ac.id/49927/3/PENUTUP.pdf
http://scholar.unand.ac.id/49927/3/PENUTUP.pdf
Autor:
Khairannisa Al Azizu
Publikováno v:
Jurnal Matematika UNAND. 7:109
Suatu pelabelan total sisi ajaib pada graf G dengan p merupakan banyak titik pada graf G dan q merupakan banyak sisi pada graf G adalah suatu fungsi bijektif f : V (G) [ E(G) ! f1; 2; 3; ; p + qg sedemikian sehingga f(u) + f(v) + f(uv) = k, untuk set
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af6dc2715e154c673b9ccfc682ee9fb9
https://doi.org/10.25077/jmu.7.1.109-114.2018
https://doi.org/10.25077/jmu.7.1.109-114.2018