Article Per Year (5 Year)
p-Index From 2019 - 2024
1.288
P-Index
This Author published in this journals
All Journal Matematika: Jurnal Teori dan Terapan Journal of the Indonesian Mathematical Society Journal of Mathematical and Fundamental Sciences Kubik JURNAL ISTEK Indonesian Journal of Combinatorics KUBIK: Jurnal Publikasi Ilmiah Matematika
Rismawati Ramdani
Department Of Mathematics, Faculty Of Sciences And Technologies, Universitas Islam Negeri Sunan Gunung Djati, Jalan A.H. Nasution No. 105,
Astronomy Chemistry Computer Science & IT Decision Sciences, Operations Research & Management Earth & Planetary Sciences Economics, Econometrics & Finance Education Mathematics Physics

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

Found 12 Documents
Search

 1   2 
On The Total Edge and Vertex Irregularity Strength of Some Graphs Obtained from Star Ramdani, Rismawati; Salman, A.N.M; Assiyatun, Hilda
Journal of the Indonesian Mathematical Society Volume 25 Number 3 (November 2019)
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.25.3.828.314-324

Abstract

Let $G=(V(G),E(G))$ be a graph and $k$ be a positive integer. A total $k$-labeling of $G$ is a map $f: V(G)\cup E(G)\rightarrow \{1,2,\ldots,k \}$. The edge weight $uv$ under the labeling $f$ is denoted by $w_f(uv)$ and defined by $w_f(uv)=f(u)+f(uv)+f(v)$. The vertex weight $v$ under the labeling $f$ is denoted by $w_f(v)$ and defined by $w_f(v) = f(v) + \sum_{uv \in{E(G)}} {f(uv)}$. A total $k$-labeling of $G$ is called an edge irregular total $k$-labeling of $G$ if  $w_f(e_1)\neq w_f(e_2)$ for every two distinct edges $e_1$ and $e_2$  in $E(G)$.  The total edge irregularity strength of $G$, denoted by $tes(G)$, is the minimum $k$ for which $G$ has an edge irregular total $k$-labeling.  A total $k$-labeling of $G$ is called a vertex irregular total $k$-labeling of $G$ if  $w_f(v_1)\neq w_f(v_2)$ for every two distinct vertices $v_1$ and $v_2$ in $V(G)$.  The total vertex irregularity strength of $G$, denoted by $tvs(G)$, is the minimum $k$ for which $G$ has a vertex irregular total $k$-labeling.  In this paper, we determine the total edge irregularity strength and the total vertex irregularity strength of some graphs obtained from star, which are gear, fungus, and some copies of stars.
Analisis Pengukuran Produk HKZL PT.Gradien Manufaktur Indonesia Menggunakan Multivariat Gage, Repeatability and Reproducibility (GRR) Melalui Analisis Faktor Selvi Marcelina; Asep Solih Awalluddin; Arief Fathcul Huda; Rismawati Ramdani; Esih Sukaesih
KUBIK Vol 6, No 2 (2021): KUBIK: Jurnal Publikasi Ilmiah Matematika
Publisher : Jurusan Matematika, Fakultas Sains dan Teknologi, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/kubik.v6i2.14555

Abstract

Measurement data is often used in determining the quality of a product. Some of the results in measurement present multivariate properties, meaning that there are many characteristics of quality. Many variables are measured to be used as a reference in improving product quality on the company's predetermined standards. But in reality, there are variations in the size or size of products that do not meet the standard of measurement used by the company. In this case, the correlation structure between quality characteristics is often overlooked. Variables that correlate in a group, but with relatively small correlations between other groups are more suitable tasks for factor analysis. Therefore, to solve The purpose of multivariate GRR through factor analysis is to identify the covariance structure between several quality characteristics in improving product quality using multivariate Gage, Repeatability and Reproducibility (GRR) through factor analysis, and find out if the HKZL product measurement system is in PT. Indonesia's Manufacturing Gradient is accepted or does not use the multivariate Gage, Repeatability and Reproducibility (GRR) method through factor analysis. In practice, the analysis step has been prepared and applied to the measurement of HKZL products in PT. Indonesian Manufacturing Gradient. The results were obtained from the measurement system on HKZL products in PT. The Indonesian Manufacturing Gradient is not accepted, meaning that the resulting product is HKZL has quality beyond the company's standards (quality standards), so it can be concluded that the HKZL product making machine is in poor condition to use.
Pelabelan Super Graceful pada Graf Caterpillar Nisa Nur Arafah; Rismawati Ramdani; Arief Fatchul Huda
KUBIK Vol 1, No 1 (2015): KUBIK : Jurnal Publikasi Ilmiah Matematika
Publisher : Jurusan Matematika, Fakultas Sains dan Teknologi, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/kubik.v1i1.322

Abstract

Misalkan G merupakan suatugraf dengan banyaknya titik pdan banyaknya sisi q. Pelabelan super graceful adalah pemetaan fungsi satu-satu pada f ∶ V(G) ∪ E(G) → {1,2, ... , p + q}sehingga f(uv) = |f(u) − f(v)| berbeda untuk setiap sisi uv ∈ E(G). Sebuah graf G disebut graf super graceful jika graf tersebut dapat dilabeli menurut definisi pelabelan super graceful. Graf caterpillar adalah graf yang jika semua titik pendannya dihilangkan akan menghasilkan lintasan. Pada makalah ini akan ditunjukkan bahwa graf caterpillar Cp n dengan kepala dan ekor yang mempunyai n badan dan 2 kaki pada tiap badan, graf caterpillar Cp n tanpa kepala dan ekor yang mempunyai n badan dan 2 kaki pada tiap badan,dan graf caterpillar Cp m,n tanpa kepala dan ekor yang mempunyai n badan dan m kaki pada tiap badan merupakan graf super graceful.
NILAI TOTAL KETAKTERATURAN TOTAL DARI DUA COPY GRAF BINTANG Rismawati Ramdani
JURNAL ISTEK Vol 8, No 2 (2014): ISTEK
Publisher : JURNAL ISTEK

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

Abstract

Misalkan graf dan adalah suatu bilangan bulat positif. Pelabelan- total pada G adalah suatu pemetaan . Bobot sisi di bawah pemetaan , dinotasikan dengan dan didefinisikan sebagai . Bobot titik di bawah pemetaan , dinotasikan dengan dan didefinisikan sebagai Suatu pelabelan- total pada dikatakan tak teratur sisi atau tak teratur titik, berturut-turut, jika bobot setiap sisi berbeda atau bobot setiap titik berbeda. Nilai total ketakteraturan sisi dari , dinotasikan dengan , adalah nilai terkecil sehingga suatu graf G memiliki pelabelan- total tak teratur sisi. Nilai total ketakteraturan titik dari , dinotasikan dengan , adalah nilai terkecil sehingga suatu graf G memiliki pelabelan- total tak teratur titik. Dua pelabelan tersebut diperkenalkan oleh Ba a, Jendro , Miller, dan Ryan pada tahun 2007. Selanjutnya, Marzuki, Salman, dan Miller mengkombinasikan kedua pelabelan di atas ke dalam suatu pelabelan baru yang dinamai pelabelan- total tak teratur total. Suatu pelabelan- total pada dikatakan tak teratur total, jika bobot setiap sisi berbeda dan bobot setiap titik berbeda. Nilai total ketakteraturan total dari , dinotasikan dengan , adalah nilai terkecil sehingga memiliki pelabelan- total tak teratur total. Pada makalah ini, ditentukan nilai total ketakteraturan total dari dua copy graf bintang.
Total Vertex Irregularity Strength dari Graf Buku Rismawati Ramdani
Matematika Vol 10, No 1 (2011): Jurnal Matematika
Publisher : Universitas Islam Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29313/jmtm.v10i1.3492

Abstract

AbstrakPelabelan total vertex irregular dari suatu graf, dengan  titik dan  sisi, adalah pemetaan  yang memenuhi  berbeda untuk setiap . Nilai disebut bobot dari titik  Total vertex irregularity strength dari  dinotasikan dengan  adalah  terkecil sehingga  memiliki pelabelan total vertex irregular. Pada makalah ini, dikaji pelabelan total vertex irregular pada graf buku . Hasil utama yang diperoleh dari penelitian ini adalah . Kata kunci: pelabelan total vertex irregular, total vertex irregularity strength, graf buku .
On The Total Edge and Vertex Irregularity Strength of Some Graphs Obtained from Star Rismawati Ramdani; A.N.M Salman; Hilda Assiyatun
Journal of the Indonesian Mathematical Society Volume 25 Number 3 (November 2019)
Publisher : IndoMS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22342/jims.25.3.828.314-324

Abstract

Let $G=(V(G),E(G))$ be a graph and $k$ be a positive integer. A total $k$-labeling of $G$ is a map $f: V(G)\cup E(G)\rightarrow \{1,2,\ldots,k \}$. The edge weight $uv$ under the labeling $f$ is denoted by $w_f(uv)$ and defined by $w_f(uv)=f(u)+f(uv)+f(v)$. The vertex weight $v$ under the labeling $f$ is denoted by $w_f(v)$ and defined by $w_f(v) = f(v) + \sum_{uv \in{E(G)}} {f(uv)}$. A total $k$-labeling of $G$ is called an edge irregular total $k$-labeling of $G$ if  $w_f(e_1)\neq w_f(e_2)$ for every two distinct edges $e_1$ and $e_2$  in $E(G)$.  The total edge irregularity strength of $G$, denoted by $tes(G)$, is the minimum $k$ for which $G$ has an edge irregular total $k$-labeling.  A total $k$-labeling of $G$ is called a vertex irregular total $k$-labeling of $G$ if  $w_f(v_1)\neq w_f(v_2)$ for every two distinct vertices $v_1$ and $v_2$ in $V(G)$.  The total vertex irregularity strength of $G$, denoted by $tvs(G)$, is the minimum $k$ for which $G$ has a vertex irregular total $k$-labeling.  In this paper, we determine the total edge irregularity strength and the total vertex irregularity strength of some graphs obtained from star, which are gear, fungus, and some copies of stars.
On The Total Irregularity Strength of Regular Graphs Rismawati Ramdani; A.N.M. Salman; Hilda Assiyatun
Journal of Mathematical and Fundamental Sciences Vol. 47 No. 3 (2015)
Publisher : Institute for Research and Community Services (LPPM) ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/j.math.fund.sci.2015.47.3.6

Abstract

Let 𝐺 = (𝑉, 𝐸) be a graph. A total labeling 𝑓: 𝑉 ∪ 𝐸 → {1, 2, ⋯ , 𝑘} iscalled a totally irregular total 𝑘-labeling of 𝐺 if every two distinct vertices 𝑥 and𝑦 in 𝑉 satisfy 𝑤𝑓(𝑥) ≠ 𝑤𝑓(𝑦) and every two distinct edges 𝑥1𝑥2 and 𝑦1𝑦2 in 𝐸satisfy 𝑤𝑓(𝑥1𝑥2) ≠ 𝑤𝑓(𝑦1𝑦2), where 𝑤𝑓(𝑥) = 𝑓(𝑥) + Σ𝑥𝑧∈𝐸(𝐺) 𝑓(𝑥𝑧) and𝑤𝑓(𝑥1𝑥2) = 𝑓(𝑥1) + 𝑓(𝑥1𝑥2) + 𝑓(𝑥2). The minimum 𝑘 for which a graph 𝐺 hasa totally irregular total 𝑘-labeling is called the total irregularity strength of 𝐺,denoted by 𝑡𝑠(𝐺). In this paper, we consider an upper bound on the totalirregularity strength of 𝑚 copies of a regular graph. Besides that, we give a dual labeling of a totally irregular total 𝑘-labeling of a regular graph and we consider the total irregularity strength of 𝑚 copies of a path on two vertices, 𝑚 copies of a cycle, and 𝑚 copies of a prism 𝐶𝑛 □ 𝑃2.
On the total vertex irregularity strength of comb product of two cycles and two stars Rismawati Ramdani
Indonesian Journal of Combinatorics Vol 3, No 2 (2019)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (323.824 KB) | DOI: 10.19184/ijc.2019.3.2.2

Abstract

Let G = (V(G),E(G)) be a graph and k be a positive integer. A total k-labeling of G is a map f : V ∪ E → {1,2,3,...,k}. The vertex weight v under the labeling f is denoted by w_f(v) and defined by w_f(v) = f(v) + \sum_{uv \in{E(G)}} {f(uv)}. A total k-labeling of G is called vertex irregular if there are no two vertices with the same weight. The total vertex irregularity strength of G, denoted by tvs(G), is the minimum k such that G has a vertex irregular total k-labeling. This labelings were introduced by Baca, Jendrol, Miller, and Ryan in 2007. Let G and H be two connected graphs. Let o be a vertex of H. The comb product between G and H, denoted by G \rhd_o H, is a graph obtained by taking one copy of G and |V(G)| copies of H and grafting the i-th copy of H at the vertex o to the i-th vertex of G. In this paper, we determine the total vertex irregularity strength of comb product of two cycles and two stars.
Analisis Pengukuran Produk HKZL PT.Gradien Manufaktur Indonesia Menggunakan Multivariat Gage, Repeatability and Reproducibility (GRR) Melalui Analisis Faktor Selvi Marcelina; Asep Solih Awalluddin; Arief Fathcul Huda; Rismawati Ramdani; Esih Sukaesih
KUBIK Vol 6, No 2 (2021): KUBIK: Jurnal Publikasi Ilmiah Matematika
Publisher : Jurusan Matematika, Fakultas Sains dan Teknologi, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/kubik.v6i2.14555

Abstract

Measurement data is often used in determining the quality of a product. Some of the results in measurement present multivariate properties, meaning that there are many characteristics of quality. Many variables are measured to be used as a reference in improving product quality on the company's predetermined standards. But in reality, there are variations in the size or size of products that do not meet the standard of measurement used by the company. In this case, the correlation structure between quality characteristics is often overlooked. Variables that correlate in a group, but with relatively small correlations between other groups are more suitable tasks for factor analysis. Therefore, to solve The purpose of multivariate GRR through factor analysis is to identify the covariance structure between several quality characteristics in improving product quality using multivariate Gage, Repeatability and Reproducibility (GRR) through factor analysis, and find out if the HKZL product measurement system is in PT. Indonesia's Manufacturing Gradient is accepted or does not use the multivariate Gage, Repeatability and Reproducibility (GRR) method through factor analysis. In practice, the analysis step has been prepared and applied to the measurement of HKZL products in PT. Indonesian Manufacturing Gradient. The results were obtained from the measurement system on HKZL products in PT. The Indonesian Manufacturing Gradient is not accepted, meaning that the resulting product is HKZL has quality beyond the company's standards (quality standards), so it can be concluded that the HKZL product making machine is in poor condition to use.
Pelabelan Super Graceful pada Graf Caterpillar Nisa Nur Arafah; Rismawati Ramdani; Arief Fatchul Huda
KUBIK Vol 1, No 1 (2015): KUBIK : Jurnal Publikasi Ilmiah Matematika
Publisher : Jurusan Matematika, Fakultas Sains dan Teknologi, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/kubik.v1i1.322

Abstract

Misalkan G merupakan suatugraf dengan banyaknya titik pdan banyaknya sisi q. Pelabelan super graceful adalah pemetaan fungsi satu-satu pada f ∶ V(G) ∪ E(G) → {1,2, ... , p + q}sehingga f(uv) = |f(u) − f(v)| berbeda untuk setiap sisi uv ∈ E(G). Sebuah graf G disebut graf super graceful jika graf tersebut dapat dilabeli menurut definisi pelabelan super graceful. Graf caterpillar adalah graf yang jika semua titik pendannya dihilangkan akan menghasilkan lintasan. Pada makalah ini akan ditunjukkan bahwa graf caterpillar Cp n dengan kepala dan ekor yang mempunyai n badan dan 2 kaki pada tiap badan, graf caterpillar Cp n tanpa kepala dan ekor yang mempunyai n badan dan 2 kaki pada tiap badan,dan graf caterpillar Cp m,n tanpa kepala dan ekor yang mempunyai n badan dan m kaki pada tiap badan merupakan graf super graceful.
Co-Authors A.N.M Salman A.N.M. Salman Arief Fatchul Huda Arief Fathcul Huda Asep Solih Awalluddin Desi Laswati Suwandi Esih Sukaesih Hilda Assiyatun Hilda Assiyatun Hilda Assiyatun, Hilda Nisa Nur Arafah Salman, A.N.M Selvi Marcelina