Article Per Year (5 Year)
p-Index From 2021 - 2026
0.562
P-Index
This Author published in this journals
All Journal Formosa Journal of Science and Technology (FJST)
Mulyono
Universitas Negeri Medan
Humanities Computer Science & IT Education Industrial & Manufacturing Engineering Social Sciences

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

Found 3 Documents
Search

 1 
Metric Dimensions and Partition Dimensions of a Multiple Fan Graph Restina Silalahi; Mulyono
Formosa Journal of Science and Technology Vol. 2 No. 1 (2023): January, 2023
Publisher : PT FORMOSA CENDEKIA GLOBAL

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.55927/fjst.v2i1.2759

Abstract

The metric dimension is a distinguishing set with minimum cardinality, while the partition dimension is a distinguishing set with cardinality. The purpose of this study is to find the metric and partition dimensions of a double fan graph which is the result of the join operation of the complete graph and the path graph. The results obtained from this study are the metric dimensions , partition dimensions. 
Application of Graph Coloring in Compilation of Work Schedules for Dr. General Hospital Nurses Ferdinand Lumbantobing Sibolga Rifka Helena W Silitonga; Mulyono
Formosa Journal of Science and Technology Vol. 2 No. 2 (2023): February 2023
Publisher : PT FORMOSA CENDEKIA GLOBAL

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.55927/fjst.v2i2.2856

Abstract

Preparation of a schedule is needed to regulate the course of work activities, but errors often occur such as schedules that are not according to the rules and schedules that clash, for that we need other alternatives that can help the process of preparing the schedule. An alternative that can be used is Graph Coloring. Graph coloring is the process of giving color to graph nodes so that no neighboring vertices have the same color, the vertices represent the nurses and the edges represent the relationships between nurses. Then coloring the graph nodes with the Welch-Powell algorithm, where each neighboring (related) vertex is not colored with the same color so that nurses with the same criteria have different groups. So that each working group of nurses formed has nurses with each criterion according to predetermined rules and there are no conflicting schedules.
Application of the Dijkstra and Floyd – Warshall Algorithms in Determining the Shortest Route to Tourist Attractions in Toba Mega Agustina Samosir; Mulyono
Formosa Journal of Science and Technology Vol. 2 No. 2 (2023): February 2023
Publisher : PT FORMOSA CENDEKIA GLOBAL

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.55927/fjst.v2i2.2858

Abstract

The Toba Regency Government focuses on developing the tourism sector, because the natural resources in Toba Regency have great potential. The purpose of this research is to determine the shortest route to an effective tourist spot and the time it takes to cover that distance. The method used to determine the shortest route is the Dijkstra and Floyd - Warshall Algorithms. Dijkstra's algorithm aims to choose the best solution from each set of solutions, while the Floyd-Warshall algorithm compares all possible paths on the graph for each vertex. Based on the research results, the shortest route for 24 tourist attractions in Toba produces the same route using both algorithms and a weighted graph is obtained.
Co-Authors Mega Agustina Samosir Restina Silalahi Rifka Helena W Silitonga