Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Deli Sains Informatika

SCRAMBLING INDEX DARI GRAF JARING LABA-LABA: SCRAMBLING INDEX DARI GRAF JARING LABA-LABA Nurul Maulida Surbakti
Deli Sains Informatika Vol. 2 No. 1 (2022): Artikel Riset Desember 2022
Publisher : LPPM Universitas Deli Sumatera

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Scrambling index of primitive graph G, denoted by K(G), is the smallest integer k such that for every pair of vertices u and v of G there exist vertex w such that there exist walks of length k that are connecting vertices u and w of G and vertices v and w of G. In this research, we discuss the scrambling index of primitive graph G consisting of s cycles where each cycle has even length and k arcs that connect each vertex in s cycless with one vertex in  the cycle. For each pair of primitive graph , we find a  formula for scrambling index that depends on s and k. Keywords: primitive graph;, spider web; scrambling index
IMPLEMENTATION OF GRAPH COLORING USING THE WELCH POWELL ALGORITHM IN SCHEDULING THESIS PROPOSAL SEMINARS IN THE MATHEMATICS STUDY PROGRAM AT UNIVERSITAS NEGERI MEDAN Nurul Maulida Surbakti
Deli Sains Informatika Vol. 2 No. 2 (2023): Artikel Riset Juni 2023
Publisher : LPPM Universitas Deli Sumatera

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

The process of arranging thesis proposal seminar schedules in the Department of Mathematics, Universitas Negeri Medan often encounters difficulties due to the large number of students who will hold seminars at the same time. So far, the scheduling process has been done manually, resulting in the schedule of thesis supervisors and examiners often conflicting with the schedules of other student seminars. To overcome this problem, the schedule is arranged by applying the concept of vertex coloring on a graph using the Welch Powell Algorithm. In the graph, vertices represent students who will hold seminars, while edges connecting two vertices indicate that the two students have one or two common thesis supervisors. This study uses a literature review method and the results show that graph coloring with the Welch Powell Algorithm can be used to arrange schedules for thesis proposal seminars in the Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Negeri Medan.