Article Per Year (5 Year)
p-Index From 2021 - 2026
10.996
P-Index
This Author published in this journals
All Journal Pythagoras: Jurnal Matematika dan Pendidikan Matematika Media Statistika BIMASTER Jurnal Pendidikan Matematika dan IPA Jurnal Gaussian Epsilon: Jurnal Matematika Murni dan Terapan CAUCHY: Jurnal Matematika Murni dan Aplikasi Journal of Mathematical and Fundamental Sciences Edumatsains Al-Jabar : Jurnal Pendidikan Matematika Indonesian Journal of Science and Mathematics Education BAREKENG: Jurnal Ilmu Matematika dan Terapan JTAM (Jurnal Teori dan Aplikasi Matematika) Teorema: Teori dan Riset Matematika VOX EDUKASI: Jurnal Ilmiah Ilmu Pendidikan Jambura Journal of Mathematics GERVASI: Jurnal Pengabdian kepada Masyarakat InPrime: Indonesian Journal Of Pure And Applied Mathematics Jurnal Pengabdian kepada Masyarakat Nusantara Jurnal AlphaEuclidEdu Jurnal Diferensial Tensor: Pure and Applied Mathematics Journal Jurnal Abdimas Bina Bangsa Komatika: Jurnal Pengabdian Kepada Masyarakat Jurnal Eurekamatika
Yundari, Yundari
Jurusan Matematika FMIPA Universtas Tanjungpura
Agriculture, Biological Sciences & Forestry Humanities Astronomy Chemistry Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Earth & Planetary Sciences Economics, Econometrics & Finance Education Energy Engineering Industrial & Manufacturing Engineering Languange, Linguistic, Communication & Media Mathematics Mechanical Engineering Physics Public Health Social Sciences Transportation Other

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

Found 4 Documents
Search
Journal : Edumatsains

 1 
BILANGAN DOMINASI LOKASI PADA LINE PAN GRAPH DAN MIDDLE PAN GRAPH Fransiskus Fran; Elishabet Yohana; Yundari Yundari
EduMatSains : Jurnal Pendidikan, Matematika dan Sains Vol 6 No 1 (2021): Juli
Publisher : Fakultas Keguruan dan Ilmu Pendidikan, Universitas Kristen Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33541/edumatsains.v6i1.2928

Abstract

Let G is a simple, connected, and undirected graph. A set D is a subset of V. If every node of V adjacent to at least one node D, then D is a dominating set of the graph G . One of the topics from dominating set is locating dominating set. Locating dominating set is dominating set on condition if every two vertices u,v elements of V-D satisfy the intersection of N(v) and D not equal to the intersection of N(u) and D with u not equal to v. The locating domination number of a graph G is the minimum cardinality of a locating dominating set in a graph G . In this study discussed the locating domination number on line pan graph (L(Tn,1)) and middle pan graph (M(Tn,1)). Locating domination number was obtained by finding dominating set from some graph. Then, does the dominating set meet the condition of locating dominating set? If it meets locating dominating set condition, then we can find the locating domination number of the graphs. In the last procedure, we get pattern location domination number of line pan graph and middle pan graph. The results of the study obtained the locating domination number of (L(Tn,1)) and (M(Tn,1)) consecutive are floor function of (2n/5)+1 and floor function of ((2n+1)/3)+1.
Penerapan Algoritma Dijkstra pada Pendistribusian Bahan Bakar Minyak di Pontianak Riski Apriadi; Bayu Prihandono; Yundari Yundari
EduMatSains : Jurnal Pendidikan, Matematika dan Sains Vol 7 No 2 (2023): Januari
Publisher : Fakultas Keguruan dan Ilmu Pendidikan, Universitas Kristen Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33541/edumatsains.v7i2.4149

Abstract

Determination of the shortest path or the fastest travel time is a problem that occurs to drivers of trucks loaded with fuel oil (BBM) when delivering their tanks to one of the public refueling stations (SPBU) in Pal Lima. To get to the destination, several paths that can be passed. This study aims to determine the shortest path and fastest travel time using Dijkstra's algorithm. Dijkstra's algorithm can be used on both directed and weighted graphs. The first step that must be done is to determine the starting node and destination node. After that, the calculation is carried out from the initial departure node to the neighboring node, the node with the smallest weight is used as the next calculation node. The same is done until all nodes are evaluated. Crossroads are assumed as vertices and between intersections as edges in Dijkstra's algorithm. From the results of the study, the shortest path was obtained through the Kapuas 2 Toll Road, Jl. Adi Sucipto, Jl. Imam Bonjol, Jl. Tanjung Pura, Jl. Rahadi, Jl. Mr. Love, Jl. Hassanudin, Jl. H. Rais, Pal III, Pal V with a minimum distance of 12,768 Km. For the fastest route, it is through the Kapuas 2 Toll Road, Jl. Major Alianyang, Jl. Arteri Supadio, Jl. General Ayani, Jl. Abdurrahman, Jl. Sultan Syahrir, Dr. Sutomo, Jl. Dr. Wahidin, Jl. Pal V with the fastest travel time of 27 minutes.
PENGEMBANGAN BAHAN AJAR BERBANTUAN MICROSOFT SWAY UNTUK MENINGKATKAN PEMAHAMAN KONSEP DAN KEMAMPUAN BERPIKIR KRITIS PESERTA DIDIK DALAM PEMBELAJARAN DARING Barita Riana Sitours; Ahmad Yani T; Yundari Yundari; Zubaidah Zubaidah; Hamdani Hamdani
EduMatSains : Jurnal Pendidikan, Matematika dan Sains Vol. 8 No. 1 (2023): Juli
Publisher : Fakultas Keguruan dan Ilmu Pendidikan, Universitas Kristen Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33541/edumatsains.v8i1.4516

Abstract

The ability to understand concepts and critical thinking skills of students in Indonesia is still relatively low and teaching materials play an important role in the learning process. This development research aims to produce teaching materials with Microsoft Sway that contain line and angle material, that was feasible to implement and effective for increasing students' conceptual understanding and critical thinking skills in online learning. The development of teaching materials is carried out by following the ADDIE method, namely analysis, design, development, implementation and evaluation. The teaching materials that have been developed are then validated by 2 media experts and 2 material experts. Teaching materials that have been validated are then tested individually (3 students) and tested on a limited group (30 students). The data in this study were obtained from response questionnaires and the results of the students' pre-test and post-test. This study produced teaching materials with Microsoft Sway that contain line and angle materials which were tested to be very feasible to implement with an average feasibility test score by material experts of 3.76 and an average feasibility score by media experts of 3.63. In addition, teaching materials with Microsoft Sway are also effective for increasing students' conceptual understanding and critical thinking skills, as evidenced by the gain score obtained based on the results of the pre-test and post-test of 0.67 which is included in the medium category and classically 86.67% of students get post-test scores that meet the minimum completeness criteria.
The Complexity of Octopus Graph, Friendship Graph, and Snail Graph Fransiskus Fran; Alexander; Yundari; Putri Romanda; Ervina Febyolga
EduMatSains : Jurnal Pendidikan, Matematika dan Sains Vol 9 No 1 (2024): July
Publisher : Fakultas Keguruan dan Ilmu Pendidikan, Universitas Kristen Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33541/edumatsains.v9i1.6042

Abstract

Graphs are basic structures that represent objects with nodes and relationships between objects with edges. Trees are one of the parts studied in graph theory along with finding the number of spanning trees of a graph such as octopus graph, friendship graph, and snail graph. The complexity of an octopus graph is strongly dependent on the number and length of tentacles, the complexity of a friendship graph is dependent on the number of triangle cycles, and the complexity of a snail graph is dependent on the number of edges and vertices located in the shell-like part of the snail. To calculate the number of spanning trees (τ(G)) of a graph, various calculations can be used, such as the extension of Kirchhoff's formula. The extension of Kirchhoff's formula uses the determinant of the adjacency matrix and degree matrix of the graph complement of a graph. Therefore, this research applies the extension of Kirchhoff's formula to obtain the complexity of octopus graph, friendship graph, and snail graph. From the analysis, it is obtained that for any n≥2, the number of spanning trees of octopus graph and friendship graph are τ(On )=1/5 √5 [((3+√5)/2)^n-((3-√5)/2)^n ] and τ(Fn )=3^n and the number of spanning trees of snail graph is τ(SIn )=2^(n+2)+3n∙2^(n-1) for n≥1.
Co-Authors Adrian, Ferry Ahmad Yani T Alexander Ananda, Adelia Angraini, Wanda Aprilianti, Aulia Aprizkiyandari, Siti Ariani, Prisilia Arizal, Arizal Asyrad, Adam Ayu Lestari Ayu Sri Utami Bambang Poniman Barita Riana Sitours Bayu Prihandono Brella Glysentia Vilgalita Chintya, Yuni Daniel Happy Putra Daska, Hipin Dea Rizki Darmawanti Dede Suratman Deni Winda Sari Desi Desi Ditanti Putri Shofia Eka Febrianti, Eka Eligia Helvianti Tri Lina P Elishabet Yohana Enis Rahayu Erlando Erlando Ervina Febyolga Evangelista, Gitta Evi Novian Evi Noviani Evy Sulistianingsih Fajria, Intan Luthfiani Fansiskus Fran Fikadila, Lisa Firhan Januardi Firmansyah, Dimas Fran, Fransiskus Fransiskus Fran Fransiskus Fran Hamdani Hamdani Hanssen, Calvin Helmi Helmi Helmi Helmi Helmi Helmi Helmi Hendra Perdana Hengki, Marius Henny Priandini Amalia Huda, Nur'ainul Miftahul HUDA, NUR’AINUL MIFTAHUL Huda, Nur’ainul Miftahul Ikbal Muhaimin Jonathan, Ryan Juwita, Dia Prima Laksono Trisnantoro Lauren, Nover Laurens Paskhia Dirda Rusanditia Lina Astuti Mariatul Kiftiah Martha, Shantika Meisita, Cheril Meliana Pasaribu Melinda Mareta Sari Mohamad Rif'at Mudinillah, Adam Muhammad Ilyas Mujiarti, Eka May Muslimah (F54210032) Nadia Putri Kurniawati Neno Juli Triami Neva Satyahadewi Nilamsari Kusumastuti Ningrum, Runi Aisyah Diyah Novia Kristefany Kabang Nurfadilah, Kori’ah NURFITRI IMRO’AH Nurfitri Im’roah Nurliantika, Nurliantika NUR’AINUL MIFTAHUL HUDA Pranata Anggi Priyatna, Tegar Rama Puspita, Urfila Dian Putra, Fajar Rahmana Putri Romanda Rachmawati, Febby Rahmah, Mhaulia Ramadhan, Rahul Ramadhanti, Tasya Redika Rayhannisa, Rayhannisa Rif'at, Mohammad Rifatullah, Rohit Riski Apriadi Rivaldi, Syahrul Rizki, Setyo Wira Ryan Jonathan Safitri, Fauziah Sasqia Aklysta Antaristi Setyo Wira Rizki Setyo Wira Rizki Shantika Martha Shantika Martha Silvia, Elma Silvy Heriyanti Suryani Suryani Takuan, Julianus Tambunan, Ayu Oktavia Tamtama, Ray Udjianna Sekteria Pasaribu Utriweni Mukhaiyar Venti, Monalisa Wele, Bruno Sala Winanda Epriyanti Yudhi Yulis Jamiah Zada Almira Zubaidah Zubaidah