Let H= (T,S), be a finite simple graph, T(H)= T and S(H)= S, respectively, are the sets of vertices and edges on H. Let σ:T∪S→1,2,· · · ,k, be a total k-labeling on H and wσ(x), be a weight of x∈T while using σ labeling, which is evaluated based on the total number of all vertices labels in the neighborhood x and its incident edges. If every x∈T has a different weight, then σ is a distance vertex irregular total k-labeling (DVITL). Total distance vertex irregularity strength of H (tdis(H) is defined as the least k for which H has a DVITL. Our research investigates the DVITL of the path (Pr) and cycle (Cr) graphs. We establish a lower bound and then calculate the precise value of tdis(Pr) and tdis(Cr).
8 April 2023 in Electronic Journal of Graph Theory and Applications
A distance vertex irregular total k-labeling of a simple undirected graph G = G(V, E), is a function f : V(G)∪E(G)→{1, 2, …, k} such that for every pair vertices u, v ∈ V(G) and u ≠ v, the weights of u and v are distinct. The weight of vertex v ∈ V(G) is defined to be the sum of the label of vertices in neighborhood of v and the label of all incident edges to v. The total distance vertex irregularity strength of G (denoted by tdis(G)) is the minimum of k for which G has a distance vertex irregular total k-labeling. In this paper, we present several results of the total distance vertex irregularity strength of some corona product graphs.
20 October 2022 in Euler : Jurnal Ilmiah Matematika, Sains dan Teknologi
In the current era, data security disturbances often occur, such as data theft by unwanted people. To overcome security problems can be handled using cryptography and steganography methods. The cryptography process generates random writing that can obscure the message making it difficult for others to read. However, cryptography itself is still too weak to secure messages, so steganography is needed to disguise the existence of the message so that it is not visible to the human eye. Apart from hiding messages, another goal is to know the impact of message insertion. In this study, the encryption steps were followed by insertion and decryption followed by extraction. In the secret message encryption process using two algorithms, namely Vigenere Cipher and Playfair Cipher. In the process of inserting a secret message using Least Significant Bit (LSB) steganography. The results of the combination of cryptography and steganography are able to secure secret messages without causing significant changes even though the digital image used before and after the steganography process has increased in size, the Mean Square Error (MSE) value obtained is 0.000136 and the Peak Signal to Noise Ratio (PSNR) value is obtained. 86.8062 dB and the result of message encryption is enough to obscure the relationship pattern in the modified secret message with an avalanche effect value of 53.06%.
29 December 2023 in Bulletin of Applied Mathematics and Mathematics Education
In the digital era, fingerprint identification plays a critical role in information technology administration. Various studies have been conducted to improve the fingerprint identification process, but there are still cases of identification failures that are fatal. This research discusses fingerprint identification with the Minkowski distance method. The data of fingerprints are taken from Mathematics students and the Kaggle site. Data analysis includes the steps of image retrieval, dimensioning, conversion to grayscale, pattern matching, and accuracy measurement. Results show an improvement in data accuracy with a structured approach to data capture and preprocessing. Results from primary data obtained an accuracy of 56.67% while from secondary data obtained an accuracy of 93%.
A total graph labeling is an assignment of integers to the union of vertices and edges to certain conditions. The labeling becomes D -distance vertex irregular total k-labeling when each vertex of G has a different weight (which is determined by D-distance neighborhood). The total distance vertex irregularity strength of G denoted by tdis(G) and define as the minimum of the biggest label k over all D-distance vertex irregular total k-labelings of G. In this paper, we investigate about D-distance vertex irregular total k-labelings on hairy cycle C_m^n graphs which can be applied to cryptography and computational networks. The unique hairy cycle graph construction makes the weights of each vertex of this graph different and random. Therefore, this weight formula can be applied in stream cipher cryptography as a key generator. To obtained the formula labeling, we carried out labeling experiments repeatedly to find labeling patterns and then formulate it into a labeling function. We also provide the lower bound and determine the value of total distance vertex irregularity strength of hairy cycle C_m^n graphs. we prove that for m=2,3,4, n≥5 an odd positive integer , hairy cycle C_m^n graphs admits an D-distance vertex irregular total k-labelings with total distance vertex irregularity strength, tdis(C_m^n )=⌈(mn+1)/2⌉.