4×4 Knight’s Graph Analysis by Modularity A Knight Graph Application

Basit Öğe Kaydı
dc.contributor.authorGüldal, Serkan
dc.date.accessioned2026-08-12T15:14:46Z
dc.date.issued2021
dc.departmentFırat Üniversitesi
dc.description.abstractModularity is a well-known technic to analyze graphs of datasets. The modularity divides the network into meaningful clusters. The clusters present the existence of shared properties between the nodes in the same cluster. In the present study, we analyze 4×4 knight graph by modularity to investigate 4-KCP solutions. Our investigation is completed for resolutions from 0.2 to 3.2. The maximum modularity score is 0.417 found (for resolution = 0.6, 0.8, 1, and 1.4). Moreover, resolution 1.4 is the optimum resolution to find some solutions of 4-KCP. Also, the analyses show resolution 0.2 is the best resolution to find all solutions of 4-KCP.
dc.identifier.endpage30
dc.identifier.issn1308-9080
dc.identifier.issn1308-9099
dc.identifier.issue1
dc.identifier.startpage23
dc.identifier.urihttps://hdl.handle.net/11508/31343
dc.identifier.volume16
dc.language.isoen
dc.publisherFırat University
dc.publisherFırat Üniversitesi
dc.relation.ispartofTurkish Journal of Science and Technology
dc.relation.publicationcategoryMakale - Ulusal Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/openAccess
dc.snmzKA_DergiPark_20260511
dc.subjectEngineering
dc.subjectMühendislik
dc.title4×4 Knight’s Graph Analysis by Modularity A Knight Graph Application
dc.typeArticle

Dosyalar

Koleksiyon

Turkish Journal of Science and Technology