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

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Turkish Journal of Science and Technology
Volume:16 Issue:1
4×4 Knight’s Graph Analysis by Modularity A Knight Graph Application

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

Authors : Serkan GÜLDAL

Pages : 23-30

View : 18 | Download : 7

Publication Date : 2021-03-15

Article Type : Research Paper

Abstract :Modularity 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 insert ignore into journalissuearticles values(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.
Keywords : Knight graph, Modularity, 4 KCP

ORIGINAL ARTICLE URL

VIEW PAPER (PDF)

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.