Article Per Year (5 Year)
p-Index From 2021 - 2026
1.578
P-Index
This Author published in this journals
All Journal Jurnal Ilmu dan Teknologi Kelautan Tropis JURNAL MATEMATIKA STATISTIKA DAN KOMPUTASI 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, Faculty Of Mathematics And Natural Sciences, Universitas 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 : 14 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 14 Documents
Search

 1   2 
Local edge antimagic chromatic number of comb products involving path graph Chandra, Ivana Joice; Silaban, Denny Riama
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 13, No 1 (2025): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2025.13.1.12

Abstract

Let G = (V, E) be a graph with n vertices and no isolated vertices. A local edge antimagic labeling of G is a bijection f : V(G)→{1, 2, …, n} such that the weights of any two adjacent edges in G are distinct, where the weight of an edge in G is defined as the sum of the labels of its end vertices. Such a labeling induces a proper edge coloring of G, with edge weights serving as the colors. The local edge antimagic chromatic number of G, denoted χ′lea(G), is the minimum number of colors used across all such labelings. In this paper, we investigate the local edge antimagic chromatic number of comb product graphs, focusing on the case where a path graph is combined with copies of other graphs—specifically paths, cycles, and ladders. The comb product of G and H, with respect to an assigned vertex, is constructed by taking one copy of G and |V(G)| copies of H and identifying the assigned vertex from the i-th copy of H to the i-th vertex of G.
Local edge antimagic coloring for chain of path and cycle Walfried, Yosua; Chandra, Ivana Joice; Silaban, Denny Riama
Indonesian Journal of Combinatorics Vol 9, No 1 (2025)
Publisher : Indonesian Combinatorial Society (InaCombS)

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

Abstract

Let G=(V,E) be a simple connected graph with vertex set V and edge set E. A local edge antimagic labeling of G is a bijection f:V (G)→{1, 2, 3, ... , |V(G)|} where the weights of any two adjacent edges of G are distinct. The weight of an edge uv is defined as w(uv) = f(u)+f(v). By assigning the color w(uv) to each edge uv ∈ E(G), we obtain a proper local edge antimagic coloring of G. The minimum number of colors required for edge coloring induced by the local edge antimagic labeling is called a local antimagic chromatic index of G. In this article, we give the exact value of the local antimagic chromatic index for the chain of path and cycle graphs.
Seagrass Restoration Review: Spatial Analysis of Potential Habitats, Innovative Restoration Methods, and Predictive Modeling for Monitoring Tika, Nurhasanah; Fauziah, Yasmin; Nurfata, Azzahra Shinta Bilqis; Koesratmoko, Eko; Patria, Mufti Petala; Silaban, Denny Riama
Jurnal Ilmu dan Teknologi Kelautan Tropis Vol. 17 No. 2 (2025): Jurnal Ilmu dan Teknologi Kelautan Tropis
Publisher : Department of Marine Science and Technology, Faculty of Fisheries and Marine Science, IPB University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29244/jitkt.v17i2.64544

Abstract

  Seagrass ecosystems are vital for maintaining marine ecological balance, supporting the blue carbon cycle, offering habitat for marine organisms, and safeguarding coastal areas against erosion. Nevertheless, seagrass ecosystems worldwide are declining substantially due to human activities and climate change. This trend is also evident in Indonesia, where approximately 7% of seagrass coverage is lost annually. This research examines existing literature on seagrass restoration by focusing on three key approaches: spatial assessment of suitable habitats, advancements in physical restoration techniques, and the creation of predictive models for evaluating restoration outcomes. The goal is to offer comprehensive insights into the challenges and prospects for improving management and establishing more effective and sustainable restoration strategies in coastal environments. A Systematic Literature Review (SLR) combined with bibliometric analysis was conducted on 177 publications from the Scopus database spanning 2019 to 2024 to identify research trends, technological advancements, and existing challenges in seagrass restoration. The research emphasizes the necessity of a holistic approach to seagrass restoration, incorporating spatial analysis, developing flexible restoration techniques, and implementing predictive modeling and statistical assessments to enhance long-term planning and monitoring efforts. The case study in Jepara demonstrates the effectiveness of participatory approaches at the local scale, despite limitations in technology and long-term monitoring. Integrating spatial and digital technologies, strengthening local capacity, international collaboration, and multidisciplinary integration are key to improving the effectiveness and sustainability of seagrass restoration, while strengthening its contribution to coastal resilience and climate change mitigation.
Restricted Size Ramsey Number for Matching versus Tree and Triangle Unicyclic Graphs of Order Six Elda Safitri; Peter John; Denny Riama Silaban
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol. 8 No. 1 (2022)
Publisher : LPPM Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Let F, G, and H be simple graphs. The graph F  arrows (G, H) if for any red-blue coloring on the edge of F, we find either a red-colored graph G or a blue-colored graph H in F. The Ramsey number r(G,H) is the smallest positive integer r such that a complete graph Kr arrows (G,H). The restricted size Ramsey number r*(G,H) is the smallest positive integer r* such that there is a graph F, of order r(G,H) and with the size r*, satisfying F arrows (G,H). In this paper we give the restricted size Ramsey number for a matching of two edges versus tree and triangle unicyclic graphs of order six.
Co-Authors Alfa Isti Ananda Bevina D Handari Budi Utami Chandra, Ivana Joice Chandra, Ivana Joice 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 Melza Rensiana Miming Fikria Camilla Mufti Petala Patria Nurfata, Azzahra Shinta Bilqis Peter John Peter John Saladin Uttunggadewa Siti Aminah Tika, Nurhasanah Tita Khalis Maryati Walfried, Yosua Zein Rasyid Himami