Claim Missing Document
Check
Articles

Found 3 Documents
Search
Journal : Science and Technology Indonesia

Enumerate the Number of Vertices Labeled Connected Graph of Order Seven Containing No Parallel Edges Muslim Ansori; Wamiliana; Fitriani; Yudi Antoni; Desiana Putri
Science and Technology Indonesia Vol. 7 No. 3 (2022): July
Publisher : Research Center of Inorganic Materials and Coordination Complexes, FMIPA Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (744.732 KB) | DOI: 10.26554/sti.2022.7.3.392-399

Abstract

A graph that is connected G(V,E) is a graph in which there is at least one path connecting every two vertices in G; otherwise, it is called a disconnected graph. Labels or values can be assigned to the vertices or edges of a graph. A vertex-labeled graph is one in which only the vertices are labeled, and an edges-labeled graph is one in which only edges are assigned values or labels. If both vertices and edges are labeled, the graph is referred to as total labeling. If given n vertices and m edges, numerous graphs can be made, either connected or disconnected. This study will be discussed the number of disconnected vertices labeled graphs of order seven containing no parallel edges and may contain loops. The results show that number of vertices labeled connected graph of order seven with no parallel edges is N(G7,m, g)l= 6,727×Cm6; while for 7≤g≤ 21, N(G7,m, g)l= kg C(m−(g−6))g−1, where k7 =30,160, k8 = 30,765, k9=21,000, k10 =28,364, k11= 26,880, k12=26,460 , k13 = 20,790, k14 =10,290, k15 = 8,022, k16 = 2,940, k17 =4,417, k18 = 2,835, k19 =210, k20 = 21, k21= 1.
The Relationship of Multiset, Stirling Number, Bell Number, and Catalan Number Wamiliana; Attiya Yuliana; Fitriani
Science and Technology Indonesia Vol. 8 No. 2 (2023): 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.2023.8.2.330-337

Abstract

Catalan numbers is not as famous as Fibonacci numbers, however this number has own its beauty and arts. Catalan numbers was discovered by Ming Antu in 1730, however, this numbers is credited to Eugene Catalan when he was studying parentheses in 1838. Catalan numbers mostly occurs in counting or enumeration problems. The Catalan numbers can be defined in more than one forms, and the most famous form is Cn = 1/n+1(2nn). In this study we will discuss the multiset construction and the relationship of the results of Multiset with Stirling, Bell, and Catalan numbers.
Commuting and Centralizing Maps on Modules Fitriani, Fitriani; Wijayanti, Indah Emilia; Faisol, Ahmad; Ali, Shakir
Science and Technology Indonesia Vol. 10 No. 3 (2025): 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.2025.10.3.690-697

Abstract

A ring is a mathematical structure composed of a set with two binary operations that follow certain axioms. One important function within a ring is the centralizing and commuting mapping, which has been extensively studied in recent decades. Commuting mappings are a special case of centralizing mappings. A module is a generalization of a ring. In this paper, we extend the concept of commuting mappings from ring to module structures. However, defining commuting mappings in modules presents a challenge, as multiplication is required for their definition, yet modules do not have this operation. Additionally, constructing nonzero centralizing and commuting mappings on modules is a nontrivial task. To address these challenges, we employ the concept of idealization as a framework for defining commuting mappings in modules. We also propose a method for constructing nonzero commuting mappings on modules by leveraging existing commuting mappings in rings. Specifically, if α is a commuting mapping on a ring T, then a corresponding commuting mapping α’ can be defined on the module by utilizing α. Moreover, we establish that the finite sum of commuting mappings is also a commuting mapping and that a linear combination of  commuting mappings is also a commuting mapping under certain conditions.