Diari Indriati
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Diari Indriati has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Isnaini Rosyida
Universitas Negeri Semarang
5 shared publications - Widodo
Department of Mathematics, Universitas Gadjah Mada, Yogyakarta, Indonesia
3 shared publications - Indah Emilia Wijayanti
§ Faculty of Mathematics and Science, University of Indonesia, Depok, Indonesia
2 shared publications Isnaini Rosyida
Faculty of Mathematics and Natural Sciences, Universitas Negeri Semarang, Semarang, Indonesia
2 shared publications- Kiki Ariyanti Sugeng
Universitas Indonesia
2 shared publications - Mulyono
Mathematics Department, Universitas Negeri Semarang, Semarang, Indonesia
2 shared publications
Latest Publications
- Open Access
- 12 April 2022
- Published by Universitas Muhammadiyah Mataram in JTAM (Jurnal Teori dan Aplikasi Matematika)
- Vol. 6 (2) , 354-370
Dominant Factor were Caused Eight Grade Students Errors in Solving on Cartesian Coordinate Multistep Routine and Non-Routine Modification Story Problems
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 learning of cartesian coordinates for eight grade it was usually represented by the frequent of student errors occurrence on an ongoing basis in solving on mathematical problems in assignments and daily tests. This research purpose was to reveal the dominant factor were caused eighth grade student errors in solving on cartesian coordinate multistep routine and non-routine modification story problems. This research is a descriptive qualitative in type. Research data collection based on survey, interview, test and documentation. The research subjects in this research were eight grade students of SMPN 4 Wonosobo. In this research 18 students of eight grade students SMPN 4 Wonosobo as the research sample. The sampling technique it was used in this research is purposive sampling. The results of this research indicate the dominant factor were caused eighth grade student errors in solving on cartesian coordinate multistep routine and non-routine modification story problems is students difficulties. Students difficulties such as compiling steps to solve problems in the form of multistep story problems, understanding the position conception of starting point with a certain point, understanding the conception of a perpendicular lines and a parallel lines to the X and Y axis, determining the distance of a point to certain point. The implication of this research is can obtain information about the dominant factor were caused student errors in solving on cartesian coordinate multistep routine and non-routine modification story problems as the relation to the current idealization of mathematics learning optimization and can be able for planing another appropriate and solution steps for the implementation of mathematics learning in an effort to minimize student errors.
- 12 April 2022
- Published by Universitas Muhammadiyah Mataram in JTAM (Jurnal Teori dan Aplikasi Matematika)
- Vol. 6 (2) , 354-370
Open AccessDominant Factor were Caused Eight Grade Students Errors in Solving on Cartesian Coordinate Multistep Routine and Non-Routine Modification Story Problems
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 learning of cartesian coordinates for eight grade it was usually represented by the frequent of student errors occurrence on an ongoing basis in solving on mathematical problems in assignments and daily tests. This research purpose was to reveal the dominant factor were caused eighth grade student errors in solving on cartesian coordinate multistep routine and non-routine modification story problems. This research is a descriptive qualitative in type. Research data collection based on survey, interview, test and documentation. The research subjects in this research were eight grade students of SMPN 4 Wonosobo. In this research 18 students of eight grade students SMPN 4 Wonosobo as the research sample. The sampling technique it was used in this research is purposive sampling. The results of this research indicate the dominant factor were caused eighth grade student errors in solving on cartesian coordinate multistep routine and non-routine modification story problems is students difficulties. Students difficulties such as compiling steps to solve problems in the form of multistep story problems, understanding the position conception of starting point with a certain point, understanding the conception of a perpendicular lines and a parallel lines to the X and Y axis, determining the distance of a point to certain point. The implication of this research is can obtain information about the dominant factor were caused student errors in solving on cartesian coordinate multistep routine and non-routine modification story problems as the relation to the current idealization of mathematics learning optimization and can be able for planing another appropriate and solution steps for the implementation of mathematics learning in an effort to minimize student errors.
- Open Access
- 1 March 2020
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1489 (1)
Edge Irregular Reflexive Labeling on Corona of Path and Other Graphs
Let G(V, E) be an undirected and simple graph with vertex set V and edge set E Define a k -labeling f on G such that the element belong to E are labeled with integers {1,2,…,ke } and the element belong to V are labeled with even integers {0,2,…,2kv }, where k = max{ke ,2kv }. A k -labeling f is mentioned as an edge irregular reflexive k -labeling if distinct edges have distinct weight. The weight of edge xy is denoted by wt(xy) and defined as wt(xy) = f (x) + f (xy) + f (y). A minimum k for which G has an edge irregular reflexive k -labeling is called reflexive edge strength of G and denoted by res(G). This paper contains investigation of edge irregular reflexive k -labeling for corona of path and other graphs and determination of their reflexive edge strengths.
- 1 March 2020
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1489 (1)
Open AccessEdge Irregular Reflexive Labeling on Corona of Path and Other Graphs
Let G(V, E) be an undirected and simple graph with vertex set V and edge set E Define a k -labeling f on G such that the element belong to E are labeled with integers {1,2,…,ke } and the element belong to V are labeled with even integers {0,2,…,2kv }, where k = max{ke ,2kv }. A k -labeling f is mentioned as an edge irregular reflexive k -labeling if distinct edges have distinct weight. The weight of edge xy is denoted by wt(xy) and defined as wt(xy) = f (x) + f (xy) + f (y). A minimum k for which G has an edge irregular reflexive k -labeling is called reflexive edge strength of G and denoted by res(G). This paper contains investigation of edge irregular reflexive k -labeling for corona of path and other graphs and determination of their reflexive edge strengths.
- 1 January 2020
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 23 (6) , 1369-1380
On total vertex irregularity strength of generalized uniform cactus chain graphs with pendant vertices
In this research, we use the concept of a vertex irregular total k labeling and tvs(G). Specifically, we investigate tvs of generalized uniform cactus chain graphs C-r(C-n(n-2)) with (n - 2)r pendant vertices and length r. The result is as follows: tvs(C-r(C-n(n-2)) = inverted right perpendicular2(n-2)r+3/4inverted left perpendicular for n >= 6.
- 1 January 2020
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 23 (6) , 1369-1380
On total vertex irregularity strength of generalized uniform cactus chain graphs with pendant vertices
In this research, we use the concept of a vertex irregular total k labeling and tvs(G). Specifically, we investigate tvs of generalized uniform cactus chain graphs C-r(C-n(n-2)) with (n - 2)r pendant vertices and length r. The result is as follows: tvs(C-r(C-n(n-2)) = inverted right perpendicular2(n-2)r+3/4inverted left perpendicular for n >= 6.
- 1 January 2020
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 23 (6) , 1335-1358
On the total edge irregularity strength of general uniform cactus chain graphs with pendant vertices
Let G(V, E) be a graph. Throughout this paper, we use the notions of edge irregular total k-labeling and total edge irregularity strength of G (tes (G)). We verify tes of general uniform cactus chain graphs C-r (C-n(n-2)) having (n - 2)r pendant vertices and length r. The result obtained is as follows: test(C-r(C-n(n-2)) = inverted right perpendicular(2n-2)r+2/3inverted left perpendicular for n >= 6.
- 1 January 2020
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 23 (6) , 1335-1358
On the total edge irregularity strength of general uniform cactus chain graphs with pendant vertices
Let G(V, E) be a graph. Throughout this paper, we use the notions of edge irregular total k-labeling and total edge irregularity strength of G (tes (G)). We verify tes of general uniform cactus chain graphs C-r (C-n(n-2)) having (n - 2)r pendant vertices and length r. The result obtained is as follows: test(C-r(C-n(n-2)) = inverted right perpendicular(2n-2)r+2/3inverted left perpendicular for n >= 6.
- Open Access
- 1 August 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1306 (1) , 012031
On Edge Irregular Total k-labeling and Total Edge Irregularity Strength of Barbell Graphs
Let G be a connected graph with a non empty vertex set V(G) and edge set E(G). An edge irregular total k-labeling of a graph G is a labeling λ : V(G) ⋃ E(G) → {1, 2, …, k}, so that every two different edges have different weights. The weight of edge uv of G is the sum of the labels vertices u and v and label of the edge uv, which is can be written as wt(uv) = λ (u) + λ (uv) + λ(v). The total edge irregularity strength of G, denoted by tes(G) is the minimum positive integer k for which the graph G has an edge irregular total k-labeling. Barbell graph Bn is obtained by connecting two copies of a complete graph Kn by a bridge. In this research, we determined the total edge irregularity strength of barbell graph Bn for n ≥ 3.
- 1 August 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1306 (1) , 012031
Open AccessOn Edge Irregular Total k-labeling and Total Edge Irregularity Strength of Barbell Graphs
Let G be a connected graph with a non empty vertex set V(G) and edge set E(G). An edge irregular total k-labeling of a graph G is a labeling λ : V(G) ⋃ E(G) → {1, 2, …, k}, so that every two different edges have different weights. The weight of edge uv of G is the sum of the labels vertices u and v and label of the edge uv, which is can be written as wt(uv) = λ (u) + λ (uv) + λ(v). The total edge irregularity strength of G, denoted by tes(G) is the minimum positive integer k for which the graph G has an edge irregular total k-labeling. Barbell graph Bn is obtained by connecting two copies of a complete graph Kn by a bridge. In this research, we determined the total edge irregularity strength of barbell graph Bn for n ≥ 3.
- Open Access
- 1 August 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1306 (1) , 012025
On Vertex Irregular Total k-labeling and Total Vertex Irregularity Strength of Lollipop Graphs
Let G be a connected graph with vertex set V(G) and edge set E(G). A vertex irregular total k-labeling λ : V ( G ) ∪ E ( G ) → { 1 , 2 , … , k } of a graph G is a labeling of vertices and edges of G in such a way that the weights of any two different vertices x and y are distinct. The weight of a vertex x in G, denoted by wt(x), is defined as the sum of the label of x and the labels of all edges incident with the vertex x. The total vertex irregularity strength of G, denoted by tvs(G), is the smallest positive integer k for which the graph G has a vertex irregular total k-labeling. The (m, n)-lollipop graphs denoted by Lm,n is a graph obtained by joining a complete graph Km to a path graph Pn with a bridge. In this research, we investigate tvs of lollipop graphs Lm,n for m ≥ 3 and n ≥ 1, denoted by tvs(Lm,n ).
- 1 August 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1306 (1) , 012025
Open AccessOn Vertex Irregular Total k-labeling and Total Vertex Irregularity Strength of Lollipop Graphs
Let G be a connected graph with vertex set V(G) and edge set E(G). A vertex irregular total k-labeling λ : V ( G ) ∪ E ( G ) → { 1 , 2 , … , k } of a graph G is a labeling of vertices and edges of G in such a way that the weights of any two different vertices x and y are distinct. The weight of a vertex x in G, denoted by wt(x), is defined as the sum of the label of x and the labels of all edges incident with the vertex x. The total vertex irregularity strength of G, denoted by tvs(G), is the smallest positive integer k for which the graph G has a vertex irregular total k-labeling. The (m, n)-lollipop graphs denoted by Lm,n is a graph obtained by joining a complete graph Km to a path graph Pn with a bridge. In this research, we investigate tvs of lollipop graphs Lm,n for m ≥ 3 and n ≥ 1, denoted by tvs(Lm,n ).
- Open Access
- 1 August 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1306 (1) , 012008
On H-supermagic labeling of friendship edge corona product with path and sun edge corona product with path
Let G be a simple, finite, connected and undirected graph with vertex set V and edge set E. Graph G admits an H-covering if every edge in E belongs to a subgraph of G isomorphic to H. Graph G is H− magic if there is a total labeling f : V ( G ) ∪ E ( G ) → { 1 , 2 , … , | V ( G ) | + | E ( G ) | } , such that each subgraph H′ = (V′, E′) of G isomorphic to H and satisfying f ( H ′ ) def = ∑ υ ∈ V ( H ′ ) f ( υ ) + ∑ e ∈ E ( H ′ ) f ( e ) = m ( f ) where m(f) is a constant magic sum. Additionaly, G admits H− supermagic if f(V ) = {1, 2, …, |V(G)|}. The edge corona product between graph G 1 and G 2 is a graph obtained by taking one copy of G 1 and |E(G 1)| copies of G 2 and then joining two end − vertices of the ith edge of G 1 to every vertex in ith copy of G 2. This research provides C 3 ◊ Pn -supermagic labeling on fn ◊ Pn and P 3 ◊ Pn -supermagic labeling on Sn ◊ Pn .
- 1 August 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1306 (1) , 012008
Open AccessOn H-supermagic labeling of friendship edge corona product with path and sun edge corona product with path
Let G be a simple, finite, connected and undirected graph with vertex set V and edge set E. Graph G admits an H-covering if every edge in E belongs to a subgraph of G isomorphic to H. Graph G is H− magic if there is a total labeling f : V ( G ) ∪ E ( G ) → { 1 , 2 , … , | V ( G ) | + | E ( G ) | } , such that each subgraph H′ = (V′, E′) of G isomorphic to H and satisfying f ( H ′ ) def = ∑ υ ∈ V ( H ′ ) f ( υ ) + ∑ e ∈ E ( H ′ ) f ( e ) = m ( f ) where m(f) is a constant magic sum. Additionaly, G admits H− supermagic if f(V ) = {1, 2, …, |V(G)|}. The edge corona product between graph G 1 and G 2 is a graph obtained by taking one copy of G 1 and |E(G 1)| copies of G 2 and then joining two end − vertices of the ith edge of G 1 to every vertex in ith copy of G 2. This research provides C 3 ◊ Pn -supermagic labeling on fn ◊ Pn and P 3 ◊ Pn -supermagic labeling on Sn ◊ Pn .
- Open Access
- 1 April 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1211 (1) , 012011
On the total vertex irregularity strength of firecracker graph
Let G be a connected graph with vertex set V (G) and edge set E(G). A total k-labeling is a labeling . A vertex irregular total k-labeling of a graph G(V; E) is a total k-labeling such that the weight for all vertices is distinct. The weight of vertex u in G, denoted by wt(u), is defined as the sum of the label of vertex u and the label of all edges incident with the vertex u. Total vertex irregularity strength of G denoted by tvs(G), is the minimum value of the largest label k over all such vertex irregular total k-labeling. The firecracker graph is a graph obtained by the concatenation of mn-stars by linking one leaf from each. In this paper, we investigate the total vertex irregularity strength of firecracker graphs, for n = 1, 2 and m > 1. For n = 1 and m > 1. For n = 2 and m > 1, is defined into 2 formulas; for 2 ≤ m ≤ 8 and for m ≥ 9.
- 1 April 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1211 (1) , 012011
Open AccessOn the total vertex irregularity strength of firecracker graph
Let G be a connected graph with vertex set V (G) and edge set E(G). A total k-labeling is a labeling . A vertex irregular total k-labeling of a graph G(V; E) is a total k-labeling such that the weight for all vertices is distinct. The weight of vertex u in G, denoted by wt(u), is defined as the sum of the label of vertex u and the label of all edges incident with the vertex u. Total vertex irregularity strength of G denoted by tvs(G), is the minimum value of the largest label k over all such vertex irregular total k-labeling. The firecracker graph is a graph obtained by the concatenation of mn-stars by linking one leaf from each. In this paper, we investigate the total vertex irregularity strength of firecracker graphs, for n = 1, 2 and m > 1. For n = 1 and m > 1. For n = 2 and m > 1, is defined into 2 formulas; for 2 ≤ m ≤ 8 and for m ≥ 9.
- Open Access
- 1 April 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1211 (1) , 012016
On total edge irregularity strength of some cactus chain graphs with pendant vertices
Let G(V, E) be a graph. A function f from to the set {1, 2, ..., k} is called an edge irregular total k-labeling of G if the weights of any two different edges ux and vy in E(G) satisfy where the weight wf (ux) is equal to the sum of label of x, label of u and label of edge ux. The total edge irregularity strength of the graph G, denoted by tes(G), is the minimum number k for which G has an edge irregular total k-labeling. In this paper, we investigate the exact value of tes of triangular cactus chain graph and para square cactus chain graph. We get the total edge irregularity strength of triangular cactus chain with length r and r + 1 pendant vertices as follows: . Further, the total edge irregularity strength of para square cactus chain graph with length r and r pendant vertices is .
- 1 April 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1211 (1) , 012016
Open AccessOn total edge irregularity strength of some cactus chain graphs with pendant vertices
Let G(V, E) be a graph. A function f from to the set {1, 2, ..., k} is called an edge irregular total k-labeling of G if the weights of any two different edges ux and vy in E(G) satisfy where the weight wf (ux) is equal to the sum of label of x, label of u and label of edge ux. The total edge irregularity strength of the graph G, denoted by tes(G), is the minimum number k for which G has an edge irregular total k-labeling. In this paper, we investigate the exact value of tes of triangular cactus chain graph and para square cactus chain graph. We get the total edge irregularity strength of triangular cactus chain with length r and r + 1 pendant vertices as follows: . Further, the total edge irregularity strength of para square cactus chain graph with length r and r pendant vertices is .
- Open Access
- 1 April 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1211 (1) , 012010
On the total edge irregularity strength of three towers hanoi graph
Let G(V, E) be a connected, simple, and undirected graph with vertex set V and edge set E. A total k-labeling is a map that carries vertices and edges of a graph G into a set of positive integer labels {1, 2, ... k}. An edge irregular total k-labeling of a graph G is a total k-labeling such that the weights calculated for all edges are distinct. The weight of an edge uv in G, denoted by wt(uv), is defined as the sum of the label of u, the label of v, and the label of uv. The total edge irregularity strength of G, denoted by tes(G), is the minimum value of the largest label k over all such edge irregular total k-labelings. The three towers hanoi graph is the state graph for Tower of Hanoi problems with three towers. In this paper, we investigate the total edge irregularity strength of three towers hanoi graph for n ≥ 1. The result is .
- 1 April 2019
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1211 (1) , 012010
Open AccessOn the total edge irregularity strength of three towers hanoi graph
Let G(V, E) be a connected, simple, and undirected graph with vertex set V and edge set E. A total k-labeling is a map that carries vertices and edges of a graph G into a set of positive integer labels {1, 2, ... k}. An edge irregular total k-labeling of a graph G is a total k-labeling such that the weights calculated for all edges are distinct. The weight of an edge uv in G, denoted by wt(uv), is defined as the sum of the label of u, the label of v, and the label of uv. The total edge irregularity strength of G, denoted by tes(G), is the minimum value of the largest label k over all such edge irregular total k-labelings. The three towers hanoi graph is the state graph for Tower of Hanoi problems with three towers. In this paper, we investigate the total edge irregularity strength of three towers hanoi graph for n ≥ 1. The result is .