Article Per Year (5 Year)
p-Index From 2020 - 2025
1.503
P-Index
This Author published in this journals
All Journal CAUCHY: Jurnal Matematika Murni dan Aplikasi Electronic Journal of Graph Theory and Applications (EJGTA) Jurnal Mahasiswa Matematika Journal of Natural A Science and Technology Indonesia BAREKENG: Jurnal Ilmu Matematika dan Terapan Jurnal Matematika UNAND Indonesian Journal of Mathematics and Applications
Abdul Rouf Alghofari
Jurusan Matematika, Fakultas MIPA, Universitas Brawijaya
Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Computer Science & IT Control & Systems Engineering Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Engineering Environmental Science Materials Science & Nanotechnology Mathematics Mechanical Engineering Physics Transportation Other

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

Found 11 Documents
Search

 1   2 
APLIKASI QUASIGROUP DALAM PEMBENTUKAN KUNCI RAHASIA PADA ALGORITMA KRIPTOGRAFI KONVENSIONAL Fadilatul I., Nur; Alghofari, Abdul Rouf
Jurnal Mahasiswa Matematika Vol 1, No 1 (2013)
Publisher : Jurnal Mahasiswa Matematika

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

Abstract

'
OPTIMASI COPRODUCTION DENGAN ECONOMIC LOT SIZING SCHEDULLING PROBLEM (ELSP) Pramudita, Riski; Alghofari, Abdul Rouf; Andawaningtyas, Kwardiniya
Jurnal Mahasiswa Matematika Vol 1, No 1 (2013)
Publisher : Jurnal Mahasiswa Matematika

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

Abstract

'
The Properties of Intuitionistic Anti Fuzzy Module t-norm and t-conorm Wijaya, Ongky Denny; Alghofari, Abdul Rouf; Hidayat, Noor; Muslikh, Mohamad
CAUCHY Vol 7, No 2 (2022): CAUCHY: Jurnal Matematika Murni dan Aplikasi (May 2022) (Issue in Progress)
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/ca.v7i2.13351

Abstract

Zadeh have introduced fuzzy set in 1965 and Atanassov have introduced intuitionistic fuzzy set in 1986 in theirs paper. Now, many of researcher connecting intuitionistic fuzzy set with algebraic structure. We interested to combine some concepts over intuitionistic fuzzy set, module of a ring, t-norm, t-conorm, and intuitionistic anti fuzzy. In this paper, we discusses about intuitionistic anti fuzzy module t-norm and t-conorm (IAFMTC) and their properties with respect to module homomorphism, maps, pre-image, and anti-image from intuitionistic fuzzy sets. We have investigate all properties of IAFMTC.
Solusi Regularitas Persamaan Diferensial Parsial Eliptik Linier Orde Dua Sa'adatul Fitri; Mohamad Muslikh; Abdul Rouf Alghofari
Journal of Natural A Vol 1, No 1 (2013)
Publisher : Fakultas MIPA Universitas Brawijaya

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

Abstract

Dalam paper ini akan dipelajari solusi regularitas dari persamaan diferensial parsial eliptik linier orde dua. Pertama akan ditunjukkan keeksisan dan ketunggalan solusi lemah dari model di ruang Hilbert. Selanjutnya akan dibangun persamaan homogen yang terkait untuk mempelajari sifat ketaksamaan Harnack dan estimasi De Giorgi-Nash-Moser. Terakhir, dengan menggunakan sifat tersebut dan karakterisasi Campanato akan ditunjukkan solusi regularitas dari model.
Total distance vertex irregularity strength of some corona product graphs Dian Eka Wijayanti; Noor Hidayat; Diari Indriati; Abdul Rouf Alghofari; Slamin Slamin
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 11, No 1 (2023): 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.2023.11.1.17

Abstract

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.
On Distance Vertex Irregular Total k-Labeling Dian Eka Wijayanti; Noor Hidayat; Diari Indriati; Abdul Rouf Alghofari; Slamin
Science and Technology Indonesia Vol. 8 No. 3 (2023): July
Publisher : Research Center of Inorganic Materials and Coordination Complexes, FMIPA Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26554/sti.2023.8.3.479-485

Abstract

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).
Ring of Weight Enumerator of Integer Azaliyah, Syarifatul; Hamid, Nur; Alghofari, Abdul Rouf; Anam, Syaiful
Indonesian Journal of Mathematics and Applications Vol. 2 No. 2 (2024): Indonesian Journal of Mathematics and Applications (IJMA)
Publisher : Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21776/ub.ijma.2024.002.02.3

Abstract

 Invariant theory can be combined with coding theory to analyze the polynomial ring over its weight enumerator. For a certain class code, especially for self-dual doubly even code or type II code, the polynomials over its code satisfy the invarian condition. In this paper, we will  show that the ring of the weight enumerator over integer of self-dual doubly even code $d_{48}^+$ cannot be ganerated by the weight enumerator of self-dual doubly even code with code length n=8, 16, 24, 32 and 40. 
Ring of Weight Enumerator of Integer Azaliyah, Syarifatul; Hamid, Nur; Alghofari, Abdul Rouf; Anam, Syaiful
Indonesian Journal of Mathematics and Applications Vol. 2 No. 2 (2024): Indonesian Journal of Mathematics and Applications
Publisher : Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21776/ub.ijma.2024.002.02.3

Abstract

 Invariant theory can be combined with coding theory to analyze the polynomial ring over its weight enumerator. For a certain class code, especially for self-dual doubly even code or type II code, the polynomials over its code satisfy the invarian condition. In this paper, we will  show that the ring of the weight enumerator over integer of self-dual doubly even code $d_{48}^+$ cannot be ganerated by the weight enumerator of self-dual doubly even code with code length n=8, 16, 24, 32 and 40. 
ON THE ENERGY OF p-SEMISHADOW AND p-NEW DUPLICATE GRAPH: Investigating Adjacency Energy in Several Graph Operations shalsabilla, Az Zahra; ALGHOFARI, ABDUL ROUF; HIDAYAT, NOOR
Jurnal Matematika UNAND Vol. 14 No. 3 (2025)
Publisher : Departemen Matematika dan Sains Data FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmua.14.3.196-207.2025

Abstract

Graph is mathematical structures used to represent relationships between objects as a vertex and edge (relationship between vertices). The energy of the graph is the absolute sum of the eigenvalues of its adjacency matrix, the graph representation matrix with entries 1 and 0. This article introduces a new graph operation, p-new duplicate, and determines energy of p-semishadow and p-new duplicate.
PERSYMMETRIC MATRIX AND ITS APPLICATION IN CODING THEORY Hidayat, Ardi Nur; Krisnawati, Vira Hari; Alghofari, Abdul Rouf
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 19 No 4 (2025): BAREKENG: Journal of Mathematics and Its Application
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol19iss4pp2831-2842

Abstract

A persymmetric matrix is a square matrix that is symmetric concerning its antidiagonal. This article discusses some characteristics of a persymmetric matrix and its application in coding theory. A persymmetric matrix is used to form a generator matrix of binary reversible self-dual codes. A binary reversible self-dual code is a self-dual code whose reverse element is contained in the code. The methodology involves the implementation of flip transpose and column reversal to ensure the generator matrix satisfies both self-duality and reversibility. We begin with small-sized persymmetric matrices (e.g., 2×2 and 3×3) to extend the construction of the larger matrices. Combining a self-dual code and a reversible self-dual code of shorter length, and embedding persymmetric blocks, we construct new binary reversible self-dual codes of longer length. The novelty of this research lies in developing a new construction method for binary reversible self-dual codes derived directly from self-dual codes in the standard form, which has not been explicitly addressed in previous studies.
Co-Authors Diari Indriati Diari Indriati Fadilatul I., Nur Hidayat, Ardi Nur Hidayat, Noor Krisnawati, Vira Hari Kwardiniya Andawaningtyas Mohamad Muslikh Noor Hidayat, Noor NUR HAMID Pramudita, Riski S Slamin Sa'adatul Fitri shalsabilla, Az Zahra Slamin Syaiful Anam Syarifatul Azaliyah, Syarifatul Wijaya, Ongky Denny Wijayanti, Dian Eka