Article Per Year (5 Year)
p-Index From 2021 - 2026
2.696
P-Index
This Author published in this journals
All Journal International Journal of Evaluation and Research in Education (IJERE) Electronic Journal of Graph Theory and Applications (EJGTA) Jurnal Matematika & Sains AKSIOMA: Jurnal Program Studi Pendidikan Matematika Jurnal Elemen Indonesian Journal of Applied Statistics Journal of Mathematics and Mathematics Education (JMME) BAREKENG: Jurnal Ilmu Matematika dan Terapan JTAM (Jurnal Teori dan Aplikasi Matematika) JCES (Journal of Character Education Society) International Journal of Computing Science and Applied Mathematics Indonesian Journal of Combinatorics Budapest International Research and Critics in Linguistics and Education Journal (Birle Journal) Mosharafa: Jurnal Pendidikan Matematika International Journal of Science and Society (IJSOC) International Journal on Education Insight Himpunan: Jurnal Ilmiah Mahasiswa Pendidikan Matematika
Diari Indriati
Universitas Sebelas Maret, Surakarta, Indonesia
Agriculture, Biological Sciences & Forestry Humanities Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Earth & Planetary Sciences Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Engineering Environmental Science Languange, Linguistic, Communication & Media Materials Science & Nanotechnology Mathematics Mechanical Engineering Physics Social Sciences Transportation Other

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

Found 24 Documents
Search

 1   2   3 
On Non Inclusive Distance Vertex Irregularity Strength of Tadpole and Path Corona Path Graphs Muhammad Bilal; Diari Indriati; Vika Yugi Kurniawan
Journal of Mathematics and Mathematics Education Vol 10, No 1 (2020): Journal of Mathematics and Mathematics Education (JMME)
Publisher : Universitas Sebelas Maret

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20961/jmme.v10i1.42405

Abstract

Let ???? = (????, ????) be a connected and simple graph with vertex set ????(????) and edge set????(????). A non inclusive distance vertex irregular labeling of a graph ???? is a mapping of ???? ∶ (????, ????) → {1, 2, … , ????} such that the weights calculated for all vertices are distinct. The weight of a vertex ????, under labeling ????, denoted by ????????(????), is defined as the sum of the label of all vertices adjacent to ???? (distance 1 from ????). A non inclusive distance vertex irregularity strength of graph ????, denoted by ????????????(????), is the minimum value of the largest label ???? over all such non inclusive distance vertex irregular labeling. In this research, we determined ????????????(????) from ????????,???? graph with ???? ≥ 3, ???? odd, ???????????? ???? ≥ 1 and ???????? ⊙ ???????? graph ????????????ℎ ???? ≥ 2 and ???? even.
Mathematical Reasoning Abilities of High School Students in Solving Contextual Problems Ainun Rahma Firdausy; Triyanto; Diari Indriati
International Journal of Science and Society Vol 3 No 1 (2021): International Journal of Science and Society (IJSOC)
Publisher : GoAcademica Research & Publishing

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (915.445 KB) | DOI: 10.54783/ijsoc.v3i1.285

Abstract

The purpose of this study was to describe students’ mathematical reasoning abilities, such as: drawing conclusions from a statement, doing mathematical manipulation, providing valid arguments and presenting mathematical statements, both verbally and in writing, in the form of pictures or graphs. This research used the descriptive qualitative method. The instruments used in this study were the main instrument (researchers) and the supporting instruments (tests and interviews). The test was given to 25 students of class XII SMA Muhammadiyah Surakarta Special Program (Muhammadiyah Surakarta Senior High School Special Program). The subjects of this study were eight students of class XII who were selected by purposive sampling technique. The results showed that students had good mathematical reasoning skills while doing mathematical manipulations and presenting mathematical statements verbally, in writing, or in pictures. Students did not show good mathematical reasoning skills when students have to draw conclusions from a statement and provide valid arguments. This is because students still do not master how to identify and determine the right strategy to solve problems, and the answers given by students were still not correct. In the future, teachers are expected to provide problems (questions) in various mathematical reasoning, so students are accustomed to working on problems with various levels of mathematical reasoning, and students’ mathematical skills can be better trained.
Total distance vertex irregularity strength of some corona product graphs Dian Eka Wijayanti; Noor Hidayat; Diari Indriati; Abdul Rouf Alghofari; Slamin Slamin
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 11, No 1 (2023): 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.2023.11.1.17

Abstract

A distance vertex irregular total k-labeling of a simple undirected graph G = G(V, E), is a function f : V(G)∪E(G)→{1, 2, …, k} such that for every pair vertices u, v ∈ V(G) and u ≠ v, the weights of u and v are distinct. The weight of vertex v ∈ V(G) is defined to be the sum of the label of vertices in neighborhood of v and the label of all incident edges to v. The total distance vertex irregularity strength of G (denoted by tdis(G)) is the minimum of k for which G has a distance vertex irregular total k-labeling. In this paper, we present several results of the total distance vertex irregularity strength of some corona product graphs.
Examining students' cognitive processes in solving algebraic numeracy problems: A Phenomenology study Monika Agnes Henny Kinanti; Imam Sujadi; Diari Indriati; Krida Singgih Kuncoro
Jurnal Elemen Vol 9 No 2 (2023): July
Publisher : Universitas Hamzanwadi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29408/jel.v9i2.13266

Abstract

Problem-solving can be understood as a cognitive process in which students know facts, processes, concepts, and procedures and then apply the knowledge to solve problems in real situations. Indonesia’s national average achievement of numeracy skills in 2021, the cognitive process of competence reasoning is higher than the competencies of knowing and applying. This study aims to analyze students' cognitive processes in solving numeration problems related to the algebraic domain. The algebraic domain in this study is limited to competencies in making generalizations from patterns in number sequences and object configuration sequences. This research was conducted qualitatively with a phenomenological design using three high-category and three low-category students to achieve data saturation. The supporting instruments are students' answers and interview results related to the algebraic domain. This study concluded that students' cognitive processes in solving numeracy problems associated with the algebraic domain in the high and low categories have different descriptions. This difference in intelligence has an impact when solving math problems. This research can help enrich the understanding of students' cognitive processes and contribute to the development of better mathematics learning strategies and curricula.
Reflexive Edge Strength on Slanting Ladder Graph and Corona of Centipede and Null Graph Ispriyanto, Mochamad Raffli; Indriati, Diari; Utomo, Putranto Hadi
Indonesian Journal of Combinatorics Vol 8, No 2 (2024)
Publisher : Indonesian Combinatorial Society (InaCombS)

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

Abstract

Assume G is a graph that is simple, undirected, and connected. If every edge label is a positive integer in the range 1 to ke, and every vertex label is a non-negative even number from 0 to 2kv, then a graph G is considered to have an edge irregular reflexive k-labeling, where k is defined as the maximum of ke and 2kv. The edge weight wt(ab) in the graph G, for the labeling λ, is defined as the function wt applied to the edge ab. The symbol res(G) denotes the reflexive edge strength, which is the largest label of the smallest k. The results of this research are as follows: res(SLm) for m≥2 is ⌈(3m−3)/3⌉ for 3m−3 ≢ 2, 3 (mod 6), and ⌈(3m−3)/3⌉+1 for 3m−3 ≡ 2, 3 (mod 6). res(Cpn ⊙ Nm) for n≥2, m≥1 is ⌈(2nm+2n−1)/3⌉ for 2nm+2n−1 ≢ 2, 3 (mod 6), and ⌈(2nm+2n−1)/3⌉+1 for 2nm+2n−1 ≡ 2, 3 (mod 6).
On Reverse Super Edge Bimagic Labeling of Gear Graph, Hibiscus Graph and Dove Tail Graph Martini, Titin Sri; Indriati, Diari; Kusmayadi, Tri Atmojo
(IJCSAM) International Journal of Computing Science and Applied Mathematics Vol 10, No 2 (2024)
Publisher : Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12962/j24775401.v10i2.21944

Abstract

A simple graph G(V,E) admits a reverse super edge bimagic labeling if there exists a bijection function ζ that taking the vertices u,w ∈ V(G) that incident on edge uw such that the sum of vertex labels incident on edge uw is subtracted from edge label are two different constants τ1 and τ2. The reverse edge bimagic labeling is said to be reverse super edge bimagic labeling if the labels of vertices are 1,2, . . . , |V(G)| and the labels of edges are |V(G)|+1, |V(G)|+2, . . . , |V(G)|+|E(G)|. In this paper we investigate that gear graph, dove tail graph, and hibiscus graph admits a reverse super edge bimagic labeling.
Pohon Keputusan pada Penilaian Mitra Menggunakan Algoritme ID3 di BPS Kota Salatiga Salsabila, Khairina Altaf; Winarno, Bowo; Indriati, Diari
Himpunan: Jurnal Ilmiah Mahasiswa Pendidikan Matematika Vol 3, No 1 (2023): Himpunan: Jurnal Ilmiah Mahasiswa Pendidikan Matematika
Publisher : Universitas Indraprasta PGRI

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

Abstract

Tujuan dari penelitian ini adalah untuk mengetahui pohon keputusan pada hasil penilaian mitra dengan algoritme iterative dichotomiser 3 (ID3) di Badan Pusat Statistik Kota Salatiga. Jumlah data yang digunakan adalah 300 data. Data tersebut dibagi menjadi data training dan data testing dengan perbandingan 80:20. Penelitian ini menggunakan lima atribut yaitu kualitas kerja, kuantitas kerja, kepemimpinan, tanggung jawab, dan kerjasama tim dengan nilai masing-masing kriteria meliputi rendah, sedang, dan tinggi. Dari hasil analisis data diperoleh 41 rules dan akurasi sebesar 93,33%.
Implementing school programs supporting numeracy: What we can learn from a junior high school in Surakarta Rofiah, Faizatur; Sujadi, Imam; Indriati, Diari
International Journal on Education Insight Vol. 5 No. 1 (2024)
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/ijei.v5i1.13677

Abstract

Mathematical literacy or numeracy has gained more attention in the education world in Indonesia. This can be seen through various efforts by the Ministry of Education to continually improve it. The research aims to provide an overview of the implementation of mathematics learning in junior high schools in Surakarta, resulting in the numeracy outcomes of students. This study adopts a qualitative approach with a case study strategy. The research data includes the implementation of numeracy, teacher activities, student activities, school environment, and documents. Data sources come from informants, including teachers and students. Data collection techniques involve interviews and documentation. The research findings reveal that the implementation of mathematics learning that strengthens numeracy at SMP Negeri 11 Surakarta and SMP Muhammadiyah Special Program Surakarta is in the stages of habituation and development. Mathematics teachers play roles as motivators, guides, and facilitators. Activities undertaken include providing books, familiarizing students with solving numeracy problems, assigning tasks, motivating students, organizing activities related to numeracy improvement, imparting knowledge, and allowing students to conduct studies.
EDGE IRREGULAR REFLEXIVE LABELING ON MONGOLIAN TENT GRAPH (M_(m,3)) AND DOUBLE QUADRILATERAL SNAKE GRAPH Indriati, Diari; Azzahra, Tsabita
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 17 No 4 (2023): BAREKENG: Journal of Mathematics and Its Applications
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol17iss4pp1933-1940

Abstract

Let G be an undirected, connected, and simple graph with edges set E(G)and vertex set V(G). An edge irregular reflexive k-labeling f is one in which the label for each edge is an integer number {1,2,…, k_e} and the label for each vertex is an even integer number {0,2,4,…,2k_v}, k = max{ k_e,2k_v}. This type of labeling results in distinct weights for each edge. The weight of an edge xy in a graph G with labeling f, indicated by wt (xy), is the total of the labels on the vertex that are incident to the edge as well as the edge label. The minimum value k of the largest label in the graph G is referred to as res (G), which stands for the reflexive edge strength of the graph G. The topic of edge irregular reflexive k-labeling for mongolian tent graph (M_(m,n)) and double quadrilateral snake graph (D(Q_n )) will be discussed in this paper. The res (M_(m,n)),m≥2,n=3 has been obtained that is ⌈(5m-1)/3⌉ for 5m-1≢2,3 (mod 6) and ⌈(5m-1)/3⌉+1 for 5m-1≡2,3 (mod 6). Also the res (D(Q_n )),n≥2 has been obtained that is ⌈(7n-7)/3⌉ for 7n-7≢2,3 (mod 6) and ⌈(5m-1)/3⌉+1 for 7n-7≡2,3 (mod 6).
EDGE IRREGULAR REFLEXIVE LABELING ON ALTERNATE TRIANGULAR SNAKE AND DOUBLE ALTERNATE QUADRILATERAL SNAKE Zalzabila, Lutfiah Alifia; Indriati, Diari; Martini, Titin Sri
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 17 No 4 (2023): BAREKENG: Journal of Mathematics and Its Applications
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol17iss4pp1941-1948

Abstract

Let G in this paper be a connected and simple graph with set V(G) which is called a vertex and E(G) which is called an edge. The edge irregular reflexive k-labeling f on G consist of integers {1,2,3,...,k_e} as edge labels and even integers {0,2,4,...,2k_v} as the label of vertices, k=max{k_e,2k_v}, all edge weights are different. The weight of an edge xy in G represented by wt(xy) is defined as wt(xy)= f (x)+ f (xy)+ f (y). The smallest k of graph G has an edge irregular reflexive k-labeling is called the reflexive edge strength, symbolized by res (G). In article, we discuss about edge irregular reflexive k-labeling of alternate triangular snake A(T_n ) and the double alternate quadrilateral snake DA(Q_n ). In this paper, the res of alternate triangular snake A(T_n ) , n≥3 has been obtained. That is ⌈(2n-1)/3⌉ for n even,2n-1≢2,3 (mod 6),⌈(2n-1)/3⌉+1 for n even,2n-1=2,3 (mod 6),⌈(2n-2)/3⌉ for n odd,2n-2≢2,3 (mod 6), and ⌈(2n-2)/3⌉+1 for n odd,2n-2=2,3 (mod 6). Then, the reflexive edge strength of double alternate quadrilateral snake DA (Q_n) ⌈ (4n-1 )/3⌉for n even, 4n - 1 ≠2,3 (mod 6), ⌈ (4n-1 )/3⌉+1 for n even, 4n - 1 = 2,3 (mod 6), ⌈ (4n-4)/3⌉ for n odd, 4n - 4 ≠2,3 (mod 6), and ⌈ (4n-4 )/3⌉+1 for n odd, 4n - 4 = 2,3 (mod 6).
Co-Authors Abdul Rouf Alghofari Adinata, Yuda candri Ainun Rahma Firdausy Akrom, Akrom Azzahra, Tsabita Bowo Winarno Budiyono Budiyono Budiyono Budiyono Eka Aprilia Enyta Ramadisae Putri Handajani, Sri Sulistijowati Hendrayanto, Dhani Nur Hidayat, Noor Imam Sujadi Imam Sujadi Indah E. Wijayanti Irfan Setiawan Isnaini Rosyida Isnaini Rosyida, Isnaini Ispriyanto, Mochamad Raffli Kiki A. Sugeng Krida Singgih Kuncoro Kusmayadi, Tri Atmojo Martini, Titin Sri Monika Agnes Henny Kinanti Muhammad Bilal Noviyanti, Ika Nurma Nugroho Arif Sudibyo Purjiyo Purjiyo Putranto Hadi Utomo Riyadi Riyadi Rofiah, Faizatur S Slamin Salsabila, Khairina Altaf Sujadi, Imam Tri Atmojo Kusmayadi Trionika Dian Wahyuningsih Triyanto Triyanto Utami, Risma Listya Vika Yugi Kurniawan W. Widodo Wijayanti, Dian Eka Winarno, Bowo Zalsa, Thetania Miftakul Zalzabila, Lutfiah Alifia