Claim Missing Document
Check
Articles

Found 8 Documents
Search
Journal : Tensor: Pure and Applied Mathematics Journal

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.
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 Disjoint Irregularity Strength of a Double and Triple Star Graphs Tilukay, Meilin Imelda; Titawanno, Tasya I.; Leleury, Zeth Arthur; Taihutu, Pranaya Dharia M.; Loves, Luvita
Tensor: Pure and Applied Mathematics Journal Vol 5 No 2 (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/tensorvol5iss2pp105-110

Abstract

The Rainbow Vertex Connection Number of Some Amalgamation of Two Cycles Taihuttu, Pranaya D. M.; Tilukay, Meilin I.; Rumlawang, Francis Y.; Wattimena, E. M. C.
Tensor: Pure and Applied Mathematics Journal Vol 6 No 1 (2025): 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/tensorvol6iss1pp57-66

Abstract

This paper focuses on rainbow vertex coloring in a graph G, in which, for every two vertices in G, there exists a rainbow vertex path where all internal vertices have distinct colors. The rainbow vertex connection number of G, denoted by rvc(G), is the minimum number of colors required to make G rainbow-vertex connected. In this paper, we determine the rainbow vertex connection number of some amalgamation of two cycles.