Article Per Year (5 Year)
p-Index From 2021 - 2026
0.444
P-Index
This Author published in this journals
All Journal Jurnal Pengolahan Pangan Riemann : Research of Mathematics and Mathematics Education
Andri
Universitas Tadulako
Agriculture, Biological Sciences & Forestry Education Mathematics

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

Found 2 Documents
Search

 1 
KARAKTERISTIK KIMIA ROTI PREBIOTIK DARI BERBAGAI PATI SAGU HASIL MODIFIKASI Abdul Rahim; Gatot Siswo Hutomo; Made Tangkas; Rosmianti; Putri Andini; Andri; Chitra Anggriani Salingkat
Jurnal Pengolahan Pangan Vol 7 No 2 (2022)
Publisher : Fakultas Pertanian Universitas Alkhairaat Palu

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31970/pangan.v7i2.83

Abstract

The purpose of this research is the chemical characteristics of prebiotic bread from various modified sago starch, namely acetylated sago starch (ASS), butyrylated sago starch (BSS), phosphorylated sago starch (PSS). Preparation of prebiotic bread was done by using a ratio of wheat flour (WF) with a single modified sago starch consisting of 360 WF:0; 180 WF: 180 ASS; 180 WF: 180 BSS and 180 WF: 180 PSS with 4 replicates. Research parameters include water, ash, fat, protein, fiber and carbohydrate content. The results showed that the best prebiotic bread was obtained at 180 WF:180 ASS with 28.33% water, 0.79% ash, 3.58% fat, 6.85% protein, 0.096% fiber and 58.98% carbohydrates. Modified sago starch has been potential as an alternative raw material for the manufacture of prebiotic bread.
Total Edge Irregularity Strength of Graph L_3⊙N_m Nikita; Sri Nurhayati; Trisha Magdalena A. Jauvani; Selvy Musdalifah; Iman Al Fajri; Andri
Riemann: Research of Mathematics and Mathematics Education Vol. 7 No. 2 (2025): EDISI AGUSTUS
Publisher : Program Studi Pendidikan Matematika Universitas Katolik Santo Agustinus Hippo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.38114/reimann.v7i2.104

Abstract

An edge irregular total k-labeling of a simple graph  is a labeling that assigns positive integers to its vertices and edges such that the weight of every edge, defined as the sum of the labels of the edge and its two incident vertices, is distinct. The smallest integer  that allows such a labeling is called the total edge irregularity strength, denoted by  In this paper, we study the total edge irregularity strength of the corona product of a ladder graph ​ and a null graph ​, denoted by  By applying constructive labeling and analyzing the resulting edge weights, we show that all edges can be assigned distinct weights. From Theorem 1, it is obtained that . This result contributes to the development of graph labeling theory and can be extended to larger ladder graphs for further applications, including cryptography and network security.
Co-Authors Abdul Rahim Chitra Anggriani Salingkat Gatot Siswo Hutomo Iman Al Fajri Made Tangkas Nikita Putri Andini Rosmianti Selvy Musdalifah Sri Nurhayati Trisha Magdalena A. Jauvani