Article Per Year (5 Year)
p-Index From 2019 - 2024
1.77
P-Index
This Author published in this journals
All Journal AKSIOMA JURNAL PENDIDIKAN MATEMATIKA Science and Technology Indonesia Jurnal Siger Matematika PELS (Procedia of Engineering and Life Science) Jurnal Dedikasi untuk Negeri Sciencestatistics: Journal of Statistics, Probability, and Its Application
Mustofa Usman
Universitas Lampung
Religion Humanities Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Education Electrical & Electronics Engineering Engineering Environmental Science Law, Crime, Criminology & Criminal Justice Materials Science & Nanotechnology Mathematics Physics Social Sciences Other

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

Found 1 Documents
Search
Journal : Science and Technology Indonesia

 1 
Enumerating the Number of Connected Vertices Labeled Graph of Order Six with Maximum Ten Loops and Containing No Parallel Edges Wamiliana Wamiliana; Amanto Amanto; Mustofa Usman; Muslim Ansori; Fadila Cahya Puri
Science and Technology Indonesia Vol. 5 No. 4 (2020): October
Publisher : Research Center of Inorganic Materials and Coordination Complexes, FMIPA Universitas Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (2285.683 KB) | DOI: 10.26554/sti.2020.5.4.131-135

Abstract

A Graph G (V, E) is said to be a connected graph if for every two vertices on the graph there exist at least a path connecting them, otherwise, the graph is disconnected. Two edges or more that connect the same pair of vertices are called parallel edges, and an edge that starts and ends at the same vertex is called a loop. A graph is called simple if it containing no loops nor parallel edges. Given n vertices and m edges, m ≥ 1, there are many graphs that can be formed, either connected or disconnected. In this research, we will discuss how to calculate the number of connected vertices labeled graphs of order six (isomorphism graphs are counted as one), with a maximum loop of ten without parallel edges.
Co-Authors . Wamiliana Achmad Yahya Teguh Panuju Agus Sutrisno Amanto Amanto Ani Amanathi Anis Mahfud Al’afi Anisa Fitriyani Dian Kurniasari Dora Panny Nurcahaya Sitorus Dorrah Azis Edwin Russel Eri Setiawan Fadila Cahya Puri Indah Suciati Khoirin Nisa Muhammad Taufiq Sofrizal Muslim Ansori Noti Ragayu Regita Elza Fitri Wardhani Utami Dewi Warsono Warsono Widiarti Widiarti