Article Per Year (5 Year)
p-Index From 2021 - 2026
0.947
P-Index
This Author published in this journals
All Journal BAREKENG: Jurnal Ilmu Matematika dan Terapan Compiler Jurnal Pengabdian Masyarakat Mandira Cendikia (JPKM-MC) KREATIF: Jurnal Pengabdian Masyarakat Nusantara
Jaya Santoso
Institut Teknologi Del
Agriculture, Biological Sciences & Forestry Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Energy Engineering Health Professions Law, Crime, Criminology & Criminal Justice Mathematics Mechanical Engineering Physics Social Sciences Transportation Other

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

Found 5 Documents
Search

 1 
THE PARTITION DIMENSION OF CYCLE BOOKS GRAPH B_(m,n) WITH A COMMON PATH P_2 Santoso, Jaya; Darmaji, Darmaji
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 19 No 2 (2025): BAREKENG: Journal of Mathematics and Its Application
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol19iss2pp791-804

Abstract

Suppose is a connected graph with elements of a set of vertices denoted by and a subset of . The distance between and is the shortest distance to every vertex in . Let be a partition of , where each subset belongs to . The representation of a vertex with respect to is defined as the set of distances from to each vertex in . If each representation of each vertex of is different, then the partition is called the resolving partition of , and the partition dimension is the smallest integer such that has a resolving partition with members. In this research, we show the partition dimensions of the cycle books graph . Cycle books graph is a graph consisting of copies of a cycle with a common path . The partition dimension of the cycle books graph for and is shown.
On the Chromatic Number of Cycle Books Graph Santoso, Jaya
Compiler Vol 14, No 1 (2025): May
Publisher : Institut Teknologi Dirgantara Adisutjipto

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.28989/compiler.v14i1.2930

Abstract

Graph coloring is a fundamental topic in graph theory, with various applications in scheduling, networking, and optimization problems. In this study, we investigate the chromatic number of the cycle books graph , a structured graph formed by attaching multiple cycles to a common path . We establish that the chromatic number of    depends on the parity of . Specifically, we prove that if  is even, the chromatic number is , while if  is odd, the chromatic number is . These results provide a deeper understanding of coloring properties in book-like graphs and contribute to the broader study of chromatic numbers in structured graph families. The findings may be extended to other variations of book graphs and related topologies in future research.
Kegiatan Del Biology Competition 2022 Dalam Meningkatkan Kemampuan Pengetahuan Siswa Toba Jaya Santoso; Merry Meryam Martgrita; Asido Saragih; Sari Muthia Silalahi; Ana Muliyana
Jurnal Pengabdian Masyarakat Mandira Cendikia Vol. 3 No. 6 (2024)
Publisher : YAYASAN PENDIDIKAN MANDIRA CENDIKIA

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

Abstract

Kegiatan pengabdian melalui kerjasama dan kolaborasi dibangun dan direalisasikan dalam bentuk kegiatan Olimpiade Biologi yang diselenggarakan oleh Institut Teknologi Del tahun 2022. Kegiatan olimpiade biologi untuk tingkat SMA/SMK ini difasilitasi oleh UPT Sains dan Matematika, Institut Teknologi Del, dengan harapan dapat meningkatkan mutu pendidikan sains khususnya bidang biologi melalui penumbuhkembangan budaya belajar, kreativitas, sikap disiplin, kerja keras untuk menguasai ilmu pengetahuan dan teknologi, dan motivasi meraih prestasi terbaik melalui kompetisi yang sehat serta menjunjung nilai-nilai sportivitas. Selain itu juga untuk meningkatkan kecerdasan bangsa dan kesadaran ilmiah untuk mempersiapkan generasi muda dalam menghadapi masa yang akan datang. Pada pelaksanakan kegiatan ini peserta yang telah mendaftarkan diri untuk ikut dalam tahap awal olimpiade biologi sebanyak 65 siswa yang berasal dari 27 sekolah SMA/SMK dimana babak final diikuti oleh 38 siswa yang keseluruhan berasal dari 12 sekolah. Pada kegiatan ini piala bergilir diberikan kepada sekolah yang meraih gelar juara umum yaitu SMA Unggul Del.
Dari Sitoluama untuk Indonesia : Menumbuhkan Generasi Ilmuwan Melalui DMSC 2024 Regina Ayunita Tarigan; Asido Saragih; Junita Amalia; Jaya Santoso; Ana Muliyana; Sari Muthia Sari; Andrew Rolas Siagian
KREATIF: Jurnal Pengabdian Masyarakat Nusantara Vol. 5 No. 2 (2025): Jurnal Pengabdian Masyarakat Nusantara
Publisher : Pusat Riset dan Inovasi Nasional

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.55606/kreatif.v5i2.6023

Abstract

The proficiency of Indonesian students in mathematics and science remains relatively low, as reflected in the 2022 PISA survey, which ranked Indonesia 69th out of 81 participating countries. This low level of mathematical and scientific literacy has become a major concern in efforts to improve the quality of education. This community service activity aims to foster interest and motivation among senior high school students (SMA/SMK/MA or equivalent) in the fields of mathematics, physics, chemistry, and biology through the organization of the Del Mathematics and Science Competition (DMSC) in 2024. The competition was conducted in two stages: an online preliminary round on November 2, 2024, and an on-site final round on November 9, 2024, at Institut Teknologi Del, coinciding with World Scientiest Day. The implementation method included competition promotion, online participant selection, and in-person contest execution with an objective scoring system. The findings indicated high enthusiasm among participants from various regions of Indonesia, along with improved understanding and confidence in solving concept-based problems. The implications of this activity suggest that science-based competitions can serve as effective platforms to raise public awareness of the importance of mastering science and support national efforts to enhance the quality of education in mathematics and science
THE METRIC DIMENSION OF CYCLE BOOK GRAPHS B_(C_(m,n) ) FORMED BY A COMMON PATH P_2 Santoso, Jaya; Darmaji, Darmaji; Muliyana, Ana; Saragih, Asido
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 20 No 2 (2026): BAREKENG: Journal of Mathematics and Its Application
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol20iss2pp1155-1166

Abstract

This paper investigates the metric dimension of a class of graphs known as cycle books, denoted ​, which feature a shared path ​ across multiple cycles. We focus on characterizing the minimum number of vertex subsets required so that each vertex in the graph can be uniquely identified by its distances to those subsets. To support our analysis, we present two propositions and a general theorem that establish the metric dimension for various configurations of cycle book graphs. Specifically, we prove that for , and for , while for . Furthermore, we provide a general result for : the metric dimension is when is odd and , or when is even and ; and when is odd and . These findings contribute to the growing body of knowledge on metric properties in graph theory, particularly in structured and cyclic graph families.This paper investigates the metric dimension of a class of graphs known as cycle books, denoted ​, which feature a shared path ​ across multiple cycles. We focus on characterizing the minimum number of vertex subsets required so that each vertex in the graph can be uniquely identified by its distances to those subsets. To support our analysis, we present two propositions and a general theorem that establish the metric dimension for various configurations of cycle book graphs. Specifically, we prove that for , and for , while for . Furthermore, we provide a general result for : the metric dimension is when is odd and , or when is even and ; and when is odd and . These findings contribute to the growing body of knowledge on metric properties in graph theory, particularly in structured and cyclic graph families.This paper investigates the metric dimension of a class of graphs known as cycle books, denoted ​, which feature a shared path ​ across multiple cycles. We focus on characterizing the minimum number of vertex subsets required so that each vertex in the graph can be uniquely identified by its distances to those subsets. To support our analysis, we present two propositions and a general theorem that establish the metric dimension for various configurations of cycle book graphs. Specifically, we prove that for , and for , while for . Furthermore, we provide a general result for : the metric dimension is when is odd and , or when is even and ; and when is odd and . These findings contribute to the growing body of knowledge on metric properties in graph theory, particularly in structured and cyclic graph families.
Co-Authors Ana Muliyana Ana Muliyana Andrew Rolas Siagian Asido Saragih Darmaji Darmaji JUNITA AMALIA Martgrita, Merry Meryam Muliyana, Ana REGINA AYUNITA TARIGAN Sari Muthia Sari Sari Muthia Silalahi