Zobrazeno 1 - 10
of 76
pro vyhledávání: '"Diari Indriati"'
Publikováno v:
Jurnal Elemen, Vol 9, Iss 2, Pp 494-508 (2023)
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 skill
Externí odkaz:
https://doaj.org/article/c26b104e69bd47a89386a48a71021520
Publikováno v:
Science and Technology Indonesia, Vol 8, Iss 3, Pp 479-485 (2023)
Let H= (T,S), be a finite simple graph, T(H)= T and S(H)= S, respectively, are the sets of vertices and edges on H. Let σ:T∪S→1,2,· · · ,k, be a total k-labeling on H and wσ(x), be a weight of x∈T while using σ labeling, which is evaluate
Externí odkaz:
https://doaj.org/article/0bcd1fefc371457281e09e8a8a48dfe3
Publikováno v:
JTAM (Jurnal Teori dan Aplikasi Matematika), Vol 6, Iss 2, Pp 354-370 (2022)
Giving a high level modification story problems with multistep routine and non-routine problems in cartesian coordinate learning is an effort to achieve optimal learning and also important because it has good effect for students. Less than optimal le
Externí odkaz:
https://doaj.org/article/01f6a7aa04294187994c1318d0668117
Autor:
Irfan Setiawan, Diari Indriati
Publikováno v:
Indonesian Journal of Combinatorics, Vol 5, Iss 1, Pp 35-45 (2021)
Let G(V,E) be a simple and connected graph which set of vertices is V and set of edges is E. Irregular reflexive k-labeling f on G(V,E) is assignment that carries the numbers of integer to elements of graph, such that the positive integer {1,2, 3,...
Externí odkaz:
https://doaj.org/article/8255eee0d49e4eecadfeb378f8b713c4
Publikováno v:
Aksioma: Jurnal Program Studi Pendidikan Matematika, Vol 10, Iss 1, Pp 401-407 (2021)
Tujuan penelitian ini adalah untuk menganalisis kemampuan pemahaman konsep matematis siswa ditinjau dari kemampuan awal matematika.penelitian ini adalah penelitian deskriftif eksploratif dengan pendekatan kualitatif. Penelitian ini dilaksanakan di SM
Externí odkaz:
https://doaj.org/article/cd111f7f36924deda5f446793b948698
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 8, Iss 2, Pp 247-254 (2020)
Assume that G(V,E) is a graph with V and E as its vertex and edge sets, respectively. We have G is simple, connected, and undirected. Given a function λ from a union of V and E into a set of k-integers from 1 until k. We call the function λ as a to
Externí odkaz:
https://doaj.org/article/6948641be57e4b47bb0378e55ad955c9
Autor:
Isnaini Rosyida, Diari Indriati
Publikováno v:
Indonesian Journal of Combinatorics, Vol 4, Iss 1, Pp 53-75 (2020)
Given graph G(V,E). We use the notion of total k-labeling which is edge irregular. The notion of total edge irregularity strength (tes) of graph G means the minimum integer k used in the edge irregular total k-labeling of G. A cactus graph G is a con
Externí odkaz:
https://doaj.org/article/0d80722acc3149bc9c493b90b4ff4e2f
Publikováno v:
Electronic Journal of Graph Theory and Applications. 11:209
Publikováno v:
International Journal of Science and Society. 3:201-211
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 an
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 8, Iss 2, Pp 247-254 (2020)
Assume that G(V,E) is a graph with V and E as its vertex and edge sets, respectively. We have G is simple, connected, and undirected. Given a function λ from a union of V and E into a set of k-integers from 1 until k. We call the function λ as a to