Garuda - Garba Rujukan Digital

p-Index From 2019 - 2024

1.503

P-Index

This Author published in this journals

All Journal Jurnal Edukasi Universitas Jember KADIKMA CAUCHY: Jurnal Matematika Murni dan Aplikasi EDU-MAT: Jurnal Pendidikan Matematika BAREKENG: Jurnal Ilmu Matematika dan Terapan Unisda Journal of Mathematics and Computer Science (UJMC) ConMathA CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS

Ermita Rizki Albirri

Universitas Jember

Author-ID : 2974998

Computer Science & IT Control & Systems Engineering Economics, Econometrics & Finance Education Energy Engineering Mathematics Mechanical Engineering Physics Transportation Other

Published : 13 Documents Claim Missing Document

Claim Missing Document

Articles

1 2

SUPER (a,d)-EDGE ANTIMAGIC TOTAL LABELING OF PENTAGONAL CHAIN GRAPH Albirri, Ermita Rizki; Dafik, D; Slamin, S
KadikmA Vol 6, No 1: April 2015
Publisher : KadikmA

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (486.346 KB)

Abstract. A G graph of order p and size q is called an (a,d)-edge antimagic total if there exist a bijection f: V(G)E(G) {1,2,â¦,p+q} such that the edge-weights, w(uv)=f(u)+f(v)+f(uv), uv E(G), form an arithmetic sequence with first term a and common difference d. Such a graph G is called super if the smallest possible labels appear on the vertices. In this paper we study super (a, d)-edge-antimagic total properties of connected PCn by using deductive axiomatic and the pattern recognition method. The result shows that a connected pentagonal chain graphs admit a super (a,d)-edge antimagic totalÂ labeling for d = 0,1,2 for n It can be concluded that the result of this research has covered all the feasible d. Key Words: (a,d)-edge antimagic vertex labeling, super (a,d)-edge antimagic total labeling, Pentagonal Chain Graph.

Partisipasi Mahasiswa dalam Pembelajaran Kooperatif Berdasarkan Lesson Study Lela Nur Safrida; Reza Ambarwati; Ermita Rizki Albirri
Jurnal Edukasi Vol 4 No 3: Nopember 2017
Publisher : UPT Penerbitan Universitas Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/jukasi.v4i3.6304

Partisipasi siswa memiliki peran penting dalam keberhasilan belajar. Partisipasi aktif siswa bisa mencapai tujuan belajar sehingga siswa bisa berprestasi akademik lebih baik. Partisipasi aktif dapat dipraktekkan dalam pembelajaran kooperatif dengan berdiskusi dalam kelompok atau kelas. Pembelajaran yang efektif dengan menggunakan pembelajaran kooperatif harus dirancang sebelum proses pembelajaran. Menurut analisis dan hasil refleksif, sebagian besar siswa di kelas telah mengikuti kegiatan belajar. Partisipasi aktif dikaitkan dengan berbicara atau memberikan pendapat, menjawab dan mengajukan pertanyaan untuk memberi ceramah atau memberikan komentar dalam diskusi di kelas. Di sisi lain, ada beberapa siswa yang pasif berpartisipasi dalam kegiatan belajar. Siswa tidak memberikan respon perilaku selama kelas. Siswa hanya perlu mendengarkan tanpa mencatat apapun. Kata Kunci : Partisipasi, pembelajaran kooperatif, lesson study

SUPER (a,d)-EDGE ANTIMAGIC TOTAL LABELING OF PENTAGONAL CHAIN GRAPH Ermita Rizki Albirri; D Dafik; S Slamin
KadikmA Vol 6 No 1 (2015): April 2015
Publisher : Department of Mathematics Education , University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/kdma.v6i1.1824

Abstract. A G graph of order p and size q is called an (a,d)-edge antimagic total if there exist a bijection f: V(G)E(G) {1,2,…,p+q} such that the edge-weights, w(uv)=f(u)+f(v)+f(uv), uv E(G), form an arithmetic sequence with first term a and common difference d. Such a graph G is called super if the smallest possible labels appear on the vertices. In this paper we study super (a, d)-edge-antimagic total properties of connected PCn by using deductive axiomatic and the pattern recognition method. The result shows that a connected pentagonal chain graphs admit a super (a,d)-edge antimagic total labeling for d = 0,1,2 for n It can be concluded that the result of this research has covered all the feasible d. Key Words: (a,d)-edge antimagic vertex labeling, super (a,d)-edge antimagic total labeling, Pentagonal Chain Graph.

Analisis Kemampuan Berpikir Kritis Mahasiswa Program Studi Pendidikan Matematika Lela Nur Safrida; Reza Ambarwati; Robiatul Adawiyah; Ermita Rizki Albirri
EDU-MAT: Jurnal Pendidikan Matematika Vol 6, No 1 (2018)
Publisher : Universitas Lambung Mangkurat

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20527/edumat.v6i1.5095

Pada dunia pendidikan, kemampuan berpikir kritis kini menjadi penting untuk dikembangkan guna menghadapi tantangan abad ke-21. Keterampilan berpikir kritis diperlukan dalam rangka membuat keputusan yang diawali dari serangkaian proses berpikir secara reflektif dan beralasan. Penelitian ini bertujuan untuk mengidentifikasi kemampuan berpikir kritis 30 mahasiswa menggunakan metode tes dan wawancara. Hasil tes kemudian dianalisis secara kuantitatif dan selanjutnya dideskripsikan ketercapaian indikator berpikir kritis pada setiap soal. Hasil analisis tes menunjukkan bahwa 23.33% atau 7 mahasiswa atau yang mulai berpikir kritis. Kelima indikator berpikir kritis hanya mampu dicapai oleh kurang dari 25% mahasiswa. Hanya 4 siswa yang berhasil mencapai kelima indikator berpikir kritis hingga menarik kesimpulan dengan tepat.Kata kunci: berpikir kritis, indikator berpikir kritis, kemampuan berpikir kritis

Pewarnaan Titik Ketakteraturan Lokal Inklusif pada Hasil Operasi Comb Graf Bintang Arika Indah Kristiana; Surya Indriani; Ermita Rizki Albirri
Contemporary Mathematics and Applications (ConMathA) Vol. 4 No. 1 (2022)
Publisher : Universitas Airlangga

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20473/conmatha.v4i1.33606

Let G(V,E) is a simple graph and connected where V(G) is vertex set and E(G) is edge set. An inclusive local irregularity vertex coloring is defined by a mapping l:V(G) à {1,2,…, k} as vertex labeling and wi : V(G) à N is function of inclusive local irregularity vertex coloring, with wi(v) = l(v) + ∑u∈N(v) l(u). In other words, an inclusive local irregularity vertex coloring is to assign a color to the graph with the resulting weight value by adding up the labels of the vertices that are neighbouring to its own label. The minimum number of colors produced from inclusive local irregularity vertex coloring of graph G is called inclusive chromatic number local irregularity, denoted by Xlisi(G). In this paper, we learn about the inclusive local irregularity vertex coloring and determine the chromatic number of comb product on star graph.

KETERHUBUNGAN PELANGI KUAT (src) PADA GRAF (1 Spl-(Cn )) UNTUK 3 ≤ n ≤ 10 Ermita Rizki Albirri; Robiatul Adawiyah; Lela Nur Safrida; Reza Ambarwati
Unisda Journal of Mathematics and Computer Science (UJMC) Vol 4 No 1 (2018): Unisda Journal of Mathematics and Computer Science
Publisher : Mathematics Department of Mathematics and Natural Sciences Unisda Lamongan

Let G be nontrivial and connected graph. A total-coloured path is called as total-rainbow if its edges and internal vertices have distinct colours. For any two vertices u and v of G, a rainbow u−v geodesic in G is a rainbow u−v path of length d(u,v), where d(u,v) is the distance between u and v. The graph G is strongly rainbow connected if there exists a rainbow u−v geodesic for any two vertices u and v in G. The strong rainbow connection number of G, denoted src(G), is the minimum number of colors that are needed in order to make G strong rainbow connected. The result shows for 1 Spl - (Cn) and 3 ≥ n ≥ 10 there exist a coloring where diam(G) = rc(G) = src(G) ≤ m and diam(G) ≤ rc(G) ≤ src(G) ≤ m with m is the number of path 1 Spl - (Cn).

Rainbow Vertex Connection Number pada Keluarga Graf Roda Firman Firman; Dafik Dafik; Ermita Rizki Albirri
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 3, No 1 (2022): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

The rainbow vertex connection was first introduced by krivelevich and yuster in 2009 which is an extension of the rainbow connection. Let graph $G =(V,E)$ is a connected graph. Rainbow vertex-connection is the assignment of color to the vertices of a graph $G$, if every vertex on graph $G$ is connected by a path that has interior vertices with different colors. The minimum number of colors from the rainbow vertex coloring in graph $G$ is called rainbow vertex connection number which is denoted $rvc(G)$. The result of the research are the rainbow vertex connection number of family wheel graphs.

Pewarnaan Titik Ketakteraturan Lokal pada Keluarga Graf Unicyclic Khilyah Munawaroh; Arika Indah Kristiana; Ermita Rizki Albirri; Dafik Dafik; Robiatul Adawiyah
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 2, No 2 (2021): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

In this research is a development of local irregularity vertex coloring of graph. The based on definition, as follows: \textbf{$l:V(G) \longrightarrow {\{1, 2, ..., k}\}$} is called vertex irregular k-labelling and \textbf{$w:V(G) \longrightarrow N$} where \textbf{$w(u) = \varSigma_{ v \in N(u)}l(v)$}, $w$ is called local irregularity vertex coloring. A condition for $w$ to be a local irregularity vertex coloring, If \textit{opt$(l)$ = min\{maks$(li); li$, vertex labelling function}, and for every \textbf{$u,v\in E(G),w(u)\ne w(v)$}. The chromatic number local irregularity vertex coloring is denoted by $\chi_{lis}(G)$. In this paper, the researchers will discuss of local irregularity vertex coloring of related unicyclic graphs and we have found the exact value of their chromatic number local irregularity, namely cricket graph, net graph, tadpole graph, \textit{peach} graph, and bull graph.

Resolving Domination Number pada Keluarga Graf Buku Quthrotul Aini Fuidah; Dafik Dafik; Ermita Rizki Albirri
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 2 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

All graph in this paper are members of family of book graph. Let $G$ is a connnected graph, and let $W = \{w_1,w_2,...,w_i\}$ a set of vertices which is dominating the other vertices which are not element of $W$, and the elements of $W$ has a different representations, so $W$ is called resolving dominating set. The minimum cardinality of resolving dominating set is called resolving domination number, denoted by $\gamma_r(G)$. In this paper we obtain the exact values of resolving dominating for family of book graph.

Dimensi Metrik Sisi Pada Beberapa Graf Unicyclic Bayu Aprilianto; Dafik Dafik; Ermita Rizki Albirri
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 2 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

All the graphs in this paper are connected graphs and $d(e,v)$ is the length of the shortest path between $e=uv$ and $v$. Let $G=(V,E)$ where $V(G)$ is a set of vertex from graph $G$ while $E(G)$ is a set of edge from graph $G$. The edge metric dimension is a topic that is closely related to the cardinality of the distance of each edge on the graph $G$ with respect to the resolving set $W$ which is denoted by $dim_E(G)$. Let if the subset of vertex $W=\{w_1,w_2,w_3,...,$ $w_k\}$, then the representation of the distance of the $uv$ edge to the set of differences is k-tuple $r(uv|W)=(d(uv,w_1),d(uv,w_2),d(uv,w_3),...,d(uv,w_k)$. A unicyclic graph is one that only has exactly one cycle. In this paper, we will study edge metric dimensions on some families of unicyclic graphs.

Co-Authors Anis Nur Afni Arika Indah Kristiana Bayu Aprilianto D. Dafik Dafik Dafik Deddy Setyawan Firman Firman Khilyah Munawaroh Quthrotul Aini Fuidah Rafiantika Megahnia Prihandini Reza Ambarwati Riniatul Nur Wahidah Riniatul Nur Wahidah Robiatul Adawiyah Robiatul Adawiyah S Slamin Sharifah Kartini Said Husain Surya Indriani

Title

Found 13 Documents
Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title Search

Found 13 Documents Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 13 Documents
Search