Article Per Year (5 Year)
p-Index From 2020 - 2025
2.697
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA) BAREKENG: Jurnal Ilmu Matematika dan Terapan Indonesian Journal of Combinatorics InPrime: Indonesian Journal Of Pure And Applied Mathematics Tensor: Pure and Applied Mathematics Journal Pattimura Proceeding : Conference of Science and Technology PENGAMATAN: Jurnal Pengabdian Masyarakat untuk Ilmu MIPA dan Terapannya
Meilin Imelda Tilukay
Universitas Pattimura
Agriculture, Biological Sciences & Forestry Astronomy Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Chemistry Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Electrical & Electronics Engineering Energy Engineering Materials Science & Nanotechnology Mathematics Mechanical Engineering Physics Transportation

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

Found 17 Documents
Search

 1   2 
Complete bipartite graph is a totally irregular total graph Meilin I. Tilukay; Pranaya D. M. Taihuttu; A. N. M. Salman; Francis Y. Rumlawang; Zeth A. Leleury
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 9, No 2 (2021): 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.2021.9.2.11

Abstract

A graph G is called a totally irregular total k-graph if it has a totally irregular total k-labeling λ : V ∪ E→ 1, 2, ... , k, that is a total labeling such that for any pair of different vertices x and y of G, their weights wt(x) and wt(y) are distinct, and for any pair of different edges e and f of G, their weights wt(e) and wt(f) are distinct. The minimum value k under labeling λ is called the total irregularity strength of G, denoted by ts(G). For special cases of a complete bipartite graph Km, n, the ts(K1, n) and the ts(Kn, n) are already determined for any positive integer n. Completing the results, this paper deals with the total irregularity strength of complete bipartite graph Km, n for any positive integer m and n.
The total disjoint irregularity strength of some certain graphs Meilin I Tilukay; A. N. M. Salman
Indonesian Journal of Combinatorics Vol 4, No 2 (2020)
Publisher : Indonesian Combinatorial Society (InaCombS)

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

Abstract

Under a totally irregular total k-labeling of a graph G = (V,E), we found that for some certain graphs, the edge-weight set W(E) and the vertex-weight set W(V) of G which are induced by k = ts(G), W(E) ∩ W(V) is a non empty set. For which k, a graph G has a totally irregular total labeling if W(E) ∩ W(V) = ∅? We introduce the total disjoint irregularity strength, denoted by ds(G), as the minimum value k where this condition satisfied. We provide the lower bound of ds(G) and determine the total disjoint irregularity strength of cycles, paths, stars, and complete graphs.
On H-Irregularity Strength of Grid Graphs Meilin Imelda Tilukay
Tensor: Pure and Applied Mathematics Journal Vol 1 No 1 (2020): Tensor : Pure And Applied Mathematics Journal
Publisher : Department of Mathematics, Faculty of Mathematics and Natural Sciences, Pattimura University, Ambon, Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/tensorvol1iss1pp1-6

Abstract

This paper deals with three graph characteristics related to graph covering named the (vertex, edge, and total, resp.) –irregularity strength of a graph admitting -covering. Those are the minimum values of positive integer such that has an -irregular (vertex, edge, and total, resp.) -labeling. The exact values of this three graph characteristics are determined for grid graph admitting grid-covering,
The Modular Irregularity Strength of Triangular Book Graphs Meilin Imelda Tilukay
Tensor: Pure and Applied Mathematics Journal Vol 2 No 2 (2021): Tensor : Pure and Applied Mathematics Journal
Publisher : Department of Mathematics, Faculty of Mathematics and Natural Sciences, Pattimura University, Ambon, Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/tensorvol2iss2pp53-58

Abstract

This paper deals with the modular irregularity strength of a graph of vertices, a new graph invariant, modified from the well-known irregularity strength, by changing the condition of the vertex-weight set associate to the irregular labeling from distinct positive integer to -the group of integer modulo . Investigating the triangular book graph , we first find the irregularity strength of triangular book graph , which is also the lower bound for the modular irregularity strength, and then construct a modular irregular -labeling. The result shows that triangular book graphs admit a modular irregular labeling and its modular irregularity strength and irregularity strength are equal, except for a small case.
The total irregularity strength of m copies of the friendship graph Meilin Tilukay; Harmanus Batkunde
Tensor: Pure and Applied Mathematics Journal Vol 3 No 1 (2022): Tensor: Pure and Applied Mathematics Journal
Publisher : Department of Mathematics, Faculty of Mathematics and Natural Sciences, Pattimura University, Ambon, Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/tensorvol3iss1pp43-48

Abstract

This paper deals with the totally irregular total labeling of the disjoin union of friendship graphs. The results shows that the disjoin union of copies of the friendship graph is a totally irregular total graph with the exact values of the total irregularity strength equals to its edge irregular total strength.
THE TOTAL IRREGULARITY STRENGTH OF SOME COMPLETE BIPARTITE GRAPHS Pranaya D. M. Taihuttu; Meilin I. Tilukay; F. Y. Rumlawang; Z. A. Leleury
Pattimura Proceeding 2017: Proceedings of the 3rd International Seminar of Basic Science
Publisher : Pattimura University

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (627.593 KB) | DOI: 10.30598/PattimuraSci.2017.ICBS3.149-157

Abstract

This paper deals with the total irregularity strength of complete bipartite graph where and .
On the Total Irregularity Strength of the Corona Product of a Path with Path Meilin Tilukay
Tensor: Pure and Applied Mathematics Journal Vol 4 No 1 (2023): Tensor: Pure and Applied Mathematics Journal
Publisher : Department of Mathematics, Faculty of Mathematics and Natural Sciences, Pattimura University, Ambon, Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/tensorvol4iss1pp21-26

Abstract

This paper deals with the totally irregular total labeling of the corona product of a path with path, cycle, and star. The results gave the exact values of the total irregularity strength of pm \dot Pn and for integer 2 \leq m \leq 3 and n\geq 3
Perbandingan Model Prediksi Frekuensi Titik Panas di Provinsi Riau dengan menggunakan LSTM Wattimena, Emanuella M C; Tilukay, Meilin Imelda
Tensor: Pure and Applied Mathematics Journal Vol 4 No 2 (2023): Tensor: Pure and Applied Mathematics Journal
Publisher : Department of Mathematics, Faculty of Mathematics and Natural Sciences, Pattimura University, Ambon, Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/tensorvol4iss2pp53-62

Abstract

The high rate of deforestation in Indonesia due to forest and land fires (karhutla) is still a problem that requires the government's attention because it has become a regional and global disaster. The worst forest fire incident in Indonesia occurred in 2019, where the area of ​​the fire was 1,649,258 ha. Riau Province is one of the provinces in Indonesia that often experiences forest fires. Sipongi noted that an average of 52,986 ha of forest and land burned in Riau Province every year from 2016-2020. Thus, this study builds a predictive model for the emergence of hotspots as one of the forest fires that aims to reduce the rate of forest fires. Prediction model built using Long Short-Term Memory Recurrent Neural Network (LSTM-RNN). The modeling is carried out using 2 data scenarios, namely multivariate data and univariate data, where multivariate data uses weather variables as predictors of hotspot frequency, and univariate data is hotspot frequency data. The data used is daily data from 2013-2020. Multivariate scenario dataset that produces RMSE of 23,323 and the correlation between actual and predicted data is 0,675554. The RMSE generated by the multivariate dataset is smaller than the RMSE generated by the model with the univariate dataset scenario, which is 25,750. However, datasets with univariate scenarios produce a larger correlation between actual and predicted values ​​when compared to multivariate dataset scenarios. The addition of weather factors as a predictor of hotspot occurrence can improve model performance, where this model is better at predicting values ​​when compared to univariate dataset scenarios even though the running time is longer. Keywords: forest and land fire, hotspots, Long Short-Term Memory, Recurrent Neural Network, prediction, time series
The Digital Image Compression Using Wavelet Daubechies Transform Maitimu, Meldry W; Rumlawang, Francis Y; Tilukay, Meilin I; Batkunde, Harmanus
Tensor: Pure and Applied Mathematics Journal Vol 5 No 1 (2024): Tensor: Pure and Applied Mathematics Journal
Publisher : Department of Mathematics, Faculty of Mathematics and Natural Sciences, Pattimura University, Ambon, Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/tensorvol5iss1pp27-32

Abstract

As a form of data representation, the obstacle faced when using digital images is the large volume of data required to represent the image. For that we need a technique that can reduce the volume of data, this thechnique is called compression. In this thesis, a very well-known wavelet transform method is chosen, namely Daubechies D4 wavelet transform, with four coefficients of scaling function, and four coefficients of wavelet function. Then implemented with MATLAB 2021 software as a programming tool to see the effect of quality on the transformed image.
The Total Irregularity Strength of a Comb Product of Stars Tilukay, Meilin Imelda; Batkunde, Harmanus
InPrime: Indonesian Journal of Pure and Applied Mathematics Vol 6, No 2 (2024)
Publisher : Department of Mathematics, Faculty of Sciences and Technology, UIN Syarif Hidayatullah

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15408/inprime.v6i2.42188

Abstract

A totally irregular total k-labeling λ: V U E → {1, 2, ⋯ , k} of a graph G is a labeling where the weights of all distinct vertices and edges are unique. The weight w(x) of a vertex x is defined as the sum of its label and the labels of all edges incident to it, while the weight w(e) of an edge e is the sum of its label and the labels of its two endpoints. The minimum k for which G admits such a labeling is known as the total irregularity strength of G, denoted ts(G). This study focuses on determining ts(G) for specific classes of trees, including the comb product of stars, where the contact vertex is the central vertex of one star, and the triple star graph.Keywords: comb product; star; total irregularity strength; totally irregular total labeling graph. AbstrakPelabelan k-total tak teratur total λ: V U E → {1, 2, ⋯ , k} dari suatu graf G adalah suatu pelabelan sedemikian sehingga bobot setiap titik dan sisi masing-masing berbeda. Bobot  suatu titik w(x)  adalah jumlah label titik x dan label setiap sisi yang terkait ke x, dan bobot suatu sisi w(e) adalah jumlah label sisi e dan kedua titik yang terkait ke e. Nilai minimum k sehingga suatu graf G memiliki pelabelan tersesebut dikenal sebagai nilai ketakteraturan total dari G, dinotasikan dengan ts(G). Pada artikel ini, ditentukan nilai ketakteraturan total dari suatu kelas graf pohon, yaitu hasil operasi comb dari graf bintang, dimana titik tetapnya adalah titik pusat graf bintang, dan graf bintang tripel. Kata Kunci: hasil operasi comb; graf bintang, nilai ketakteraturan total; pelabelan total tak teratur total. 2020MSC: 05C78
Co-Authors A. N. M. Salman A. N. M. Salman Batkunde, Harmanus F. Y. Rumlawang F. Y. Rumlawang, F. Y. Francis Y. Rumlawang H. W. M. Patty Ilwaru, Venn Y. I. Latupeirissa, Sanlly J Lexy Janzen Sinay, Lexy Janzen Loves, Luvita Maitimu, Meldry W Novita Dahoklory Patty, Dyana Pelu, Shelma M Pranaya D. M. Taihuttu Pranaya D. M. Taihuttu Rahangmetan, R. D. S. Rumlawang, Francis Y Rumlawang, Francis Y. Taihuttu, Pranaya D. M. Taihutu, Pranaya Dharia M. Talakua, M. W. Titawanno, Tasya I. Wattimena, E. M. C. Wattimena, Emanuella M C Z. A. Leleury Zeth A. Leleury Zeth Arthur Leleury, Zeth Arthur