Article Per Year (5 Year)
p-Index From 2021 - 2026
1.152
P-Index
This Author published in this journals
All Journal Jurnal Ilmu dan Teknologi Kelautan Tropis Electronic Journal of Graph Theory and Applications (EJGTA) Jurnal Matematika & Sains Journal of Mathematical and Fundamental Sciences Indonesian Journal of Combinatorics Makara Journal of Science International Journal of Computing Science and Applied Mathematics-IJCSAM
Denny Riama Silaban
Department Of Mathematics, FMIPA, Universitas Indonesia, Depok, Indonesia
Astronomy Biochemistry, Genetics & Molecular Biology Chemistry Computer Science & IT Decision Sciences, Operations Research & Management Earth & Planetary Sciences Electrical & Electronics Engineering Library & Information Science Mathematics Physics

Published : 10 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Indonesian Journal of Combinatorics

 1 
Super local edge anti-magic total coloring of paths and its derivation Fawwaz Fakhrurrozi Hadiputra; Denny Riama Silaban; Tita Khalis Maryati
Indonesian Journal of Combinatorics Vol 3, No 2 (2019)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (636.8 KB) | DOI: 10.19184/ijc.2019.3.2.6

Abstract

Suppose G(V,E) be a connected simple graph and suppose u,v,x be vertices of graph G. A bijection f : V ∪ E → {1,2,3,...,|V (G)| + |E(G)|} is called super local edge antimagic total labeling if for any adjacent edges uv and vx, w(uv) 6= w(vx), which w(uv) = f(u)+f(uv)+f(v) for every vertex u,v,x in G, and f(u) < f(e) for every vertex u and edge e ∈ E(G). Let γ(G) is the chromatic number of edge coloring of a graph G. By giving G a labeling of f, we denotes the minimum weight of edges needed in G as γleat(G). If every labels for vertices is smaller than its edges, then it is be considered γsleat(G). In this study, we proved the γ sleat of paths and its derivation.
On local antimagic vertex coloring of corona products related to friendship and fan graph Zein Rasyid Himami; Denny Riama Silaban
Indonesian Journal of Combinatorics Vol 5, No 2 (2021)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2021.5.2.7

Abstract

Let G=(V,E) be connected graph. A bijection f : E → {1,2,3,..., |E|} is a local antimagic of G if any adjacent vertices u,v ∈ V satisfies w(u)≠ w(v), where w(u)=∑e∈E(u) f(e), E(u) is the set of edges incident to u. When vertex u is assigned the color w(u), we called it a local antimagic vertex coloring of G. A local antimagic chromatic number of G, denoted by χla(G), is the minimum number of colors taken over all colorings induced by the local antimagic labeling of G. In this paper, we determine the local antimagic chromatic number of corona product of friendship and fan with null graph on m vertices, namely, χla(Fn ⊙ \overline{K_m}) and χla(f(1,n) ⊙ \overline{K_m}).
Co-Authors Alfa Isti Ananda Bevina D Handari Budi Utami Dhian Widya Edy Tri Baskoro Elda Safitri Elda Safitri Eunike Setiawan Eunike Setiawan Fauziah, Yasmin Fawwaz Fakhrurrozi Hadiputra Fawwaz Fakhrurrozi Hadiputra Joshita Djajadisastra Joshita Djajadisastra, Joshita Kiki Ariyanti Sugeng Koesratmoko, Eko Mufti Petala Patria Nurfata, Azzahra Shinta Bilqis Peter John Peter John Saladin Uttunggadewa Saladin Uttunggadewa Siti Aminah Tika, Nurhasanah Tita Khalis Maryati Zein Rasyid Himami