Show simple item record

dc.contributor.advisorSyahmarani, Aghni
dc.contributor.authorBr Ginting, Seykha Riskiyani
dc.date.accessioned2025-07-24T03:10:47Z
dc.date.available2025-07-24T03:10:47Z
dc.date.issued2025-07-22
dc.identifier.urihttps://repositori.usu.ac.id/handle/123456789/106732
dc.description.abstractThis study discusses automorphisms in fan graphs, which are formed by combining a friendship graph Fn and a path graph pm, with one of the end vertices in the path graph pm directly connected to the central vertex of Fn. The main objective of this study is to determine the number of automorphisms of the fan graph Fnpm and to examine whether the automorphisms of the fan graph Fnpm form a group. The method used in this study is literature review. Based on the characteristics of the fan graph, it was found that automorphisms only occur in the triangular part of the graph Fn, whereas the path pm has only the identity automorphism due to restrictions in vertex swapping. The results of the study show that the number of automorphisms of the fan graph Fnpm is 2n.n! for n ≥2, and the automorphisms of the fan graph Fnpm form a group.en_US
dc.language.isoiden_US
dc.publisherUniversitas Sumatera Utaraen_US
dc.subjectAutomorphismen_US
dc.subjectFan Graphen_US
dc.subjectGraph Theoryen_US
dc.subjectGroupen_US
dc.titleAutomorfisma Graf Kipas Anginen_US
dc.title.alternativeThe Automorphism of A Fan Graphen_US
dc.typeThesisen_US
dc.identifier.nimNIM210803043
dc.identifier.nidnNIDN0009128703
dc.identifier.kodeprodiKODEPRODI44201#Matematika
dc.description.pages51 Pagesen_US
dc.description.typeSkripsi Sarjanaen_US
dc.subject.sdgsSDGs 4. Quality Educationen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record