Article Per Year (5 Year)
p-Index From 2021 - 2026
0.444
P-Index
This Author published in this journals
All Journal Science and Technology Indonesia Jurnal Matematika Integratif
Muna, Naelufa Syifna Wifaqotul
Unknown Affiliation
Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Electrical & Electronics Engineering Engineering Environmental Science Materials Science & Nanotechnology Mechanical Engineering Physics Transportation

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

Found 2 Documents
Search

 1 
Diseksi-4 atas Fungsi Pembangkit Partisi Frobenius Diperumum dengan 4-pewarnaan Muna, Naelufa Syifna Wifaqotul; Isnaini, Uha
Jurnal Matematika Integratif Vol 20, No 1: April 2024
Publisher : Department of Matematics, Universitas Padjadjaran

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24198/jmi.v20.n1.53999.81-88

Abstract

Suatu partisi dari bilangan bulat positif $n$ adalah barisan tak naik atas bilangan bulat positif sedemikian hingga jumlahnya adalah $n$. Frobenius memperkenalkan suatu simbol yang merepresentasikan partisi dalam bentuk matriks yang kemudian disebut simbol Frobenius. Tahun 1984, Andrews mengenalkan konsep partisi Frobenius diperumum atau F-partisi serta partisi Frobenius diperumum dengan $k$-pewarnaan. Banyaknya F-partisi dengan $k$-pewarnaan dari suatu bilangan bulat positif $n$ disebut sebagai fungsi partisi Frobenius diperumum dengan $k$-pewarnaan, dinotasikan dengan $c\phi_k (n)$. Baruah dan Salmah kemudian mengkaji F-partisi 4-pewarnaan dan memperoleh fungsi pembangkit $c\phi_4 (4n+3)$ dan kongruensi-kongruensi terkait $c\phi_4 (n)$. Dalam paper ini, ditemukan fungsi pembangkit $c\phi_4 (4n)$ dan $c\phi_4 (4n+1)$ yang melengkapi diseksi-4 dari $c\phi_4(n)$. Lebih lanjut, ditemukan pula kongruensi $c\phi_4(4n+1) \equiv 0 \pmod{16}$ yang mengakibatkan $c\phi_4 (n) \equiv 0 \pmod 4$, untuk setiap $n \not \equiv 0 \pmod 4$.
Some Properties of Generalized Token Graphs Muna, Naelufa Syifna Wifaqotul; Raventino; Utami, Rintang; Lia, Febby Desy; Huda, Muhammad Nurul; Susanti, Yeni
Science and Technology Indonesia Vol. 11 No. 2 (2026): April
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.2026.11.2.643-651

Abstract

The generalized k-token graph GFk(G) is a graph with the k-subsets of V(G) as the vertices, and two different vertices are adjacent if and only if the symmetric difference contains at least one edge of G. This model extends the classical k-token graph by relaxing the adjacency condition, leading to increased edge density and altered topological properties. In this paper, we establish the fundamental properties of GFk(G), including its connectivity, duality, and monotonicity. We provide exact formulas for the vertex degrees and the total size of GF2(G), along with combinatorial bounds for k > 2. Furthermore, we characterize the girth and clique numbers, proving that GFk(G) is highly prone to containing triangles even when the base graph is triangle-free. We also explore the inheritance of Hamiltonicity and bipartiteness, demonstrating that while connectivity is preserved, bipartiteness is lost for almost all bipartite graphs with at least four vertices. Our results provide a comprehensive structural characterization of this generalization, bridging the gap between classical token graphs and broader set-theoretic graph constructions.
Co-Authors Lia, Febby Desy Muhammad Nurul Huda Raventino Uha Isnaini Utami, Rintang Yeni Susanti