SavedAdd your journal

Journals / Adıyaman Üniversitesi Mühendislik Bilimleri Dergisi / 2020 / Cilt: 7 - Sayı: 13

IDENTIFICATION OF KNIGHTS’ RELATIONS FOR 5×5 KNIGHT GRAPH BY MODULARITY

5×5 AT ÇİZGESİ İÇİN MODÜLERLİK İLE AT İLİŞKİLERİ TANIMI

Serkan GÜLDAL
Pages
104–114
Publication Date
2022-10-12
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Lastly, modularity extracts the solutions from 1 to 7 out of 172 solutions.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Modularity is a widely utilized technic to analyze graphs.
📊
Key Findings & Data:In the present study, we analyze 5×5 knight graph by modularity to extract 5 Knight Covering Problem (5-KCP) solutions.
💡
Conclusion & Impact:Lastly, modularity extracts the solutions from 1 to 7 out of 172 solutions.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:At çizgesi · modülerlik · 5-AKP

Abstract

Modularity is a widely utilized technic to analyze graphs. The modularity divides the specified network into relational clusters. The clusters highlight the shared properties between the clustered nodes. In the present study, we analyze 5×5 knight graph by modularity to extract 5 Knight Covering Problem (5-KCP) solutions. Our investigation is completed for resolutions from 0.1 to 1.8. The maximum modularity score is 0.3 found for resolution 0.8. Moreover, resolution 0.1 is the best resolution to find more solutions of 5-KCP. Also, the analyses show resolution 1.0 is the best resolution to find the solutions of 5-KCP efficiently. Lastly, modularity extracts the solutions from 1 to 7 out of 172 solutions.

Özet

Modülerlik çok kullanılan çizge analiz tekniğidir. Modülerlik belirtilen ağı anlamlı ilişkili gruplara ayırır. Gruplar aynı gruptaki düğümler arasındaki ortak özelliklerin varlığını belirtir. Bu çalışmada 5 At Kaplama Problemi (5-AKP) çözüm arayışında 5×5 at çizgesi modülerlik ile analiz ediyoruz. Araştırmamız çözünürlüğün 0.1 ile 1.8 olduğu aralık için tamamlandı. Maksimum modülerlik puanı 0.8 çözünürlüğü için 0.3 bulundu. Buna ek olarak 0.1 5-AKP’nin bazı çözümlerini bulmak için ideal çözünürlüktür. Ayrıca, analizler 1.0 çözünürlüğünün 5-AKP’nin çözümleri bulmak için en optimize çözünürlük olduğunu gösterdi. Son olarak modülerlik 172 çözümden 1’den 7’ye kadar tanımlayabilmektedir.

🔖

Cite This Article

GÜLDAL, S. (2022). IDENTIFICATION OF KNIGHTS’ RELATIONS FOR 5×5 KNIGHT GRAPH BY MODULARITY. Adıyaman Üniversitesi Mühendislik Bilimleri Dergisi, Cilt: 7 - Sayı: 13, 104–114. https://ajindex.com/articles/428611

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (6)

  1. S. Bai, G. Zhu, and J. Huang, "An Intelligent Algorithm for the (1,2,2)-Generalized Knight's Tour Problem," in 2013 Ninth International Conference on Computational Intelligence and Security, 2013, pp. 583-588. H. Jian and B. Sen, "An Efficient Algorithm for the Generalized (1,k)-Knight's Tours Problem," in 2009 First International Workshop on Education Technology and Computer Science, 2009, vol. 1, pp. 697-701.
  2. P. Hingston and G. Kendall, Ant Colonies Discover Knight's Tours. 2004, pp. 1213-1218.
  3. S. Bai, X. Liao, X. Qu, and Y. Liu, "Generalized Knight's Tour Problem and Its Solutions Algorithm," in 2006 International Conference on Computational Intelligence and Security, 2006, vol. 1, pp. 570-573. I. Parberry, "An Efficient Algorithm for the Knight's Tour Problem," Discrete Applied Mathematics, vol. 73, pp. 251-260, 03/01 1997. J. Demaio and B. Mathew, "Which Chessboards have a Closed Knight's Tour within the Rectangular Prism?," Electr. J. Comb., vol. 18, 01/05 2011. A. Kumar, "Non-crossing Knight's Tour in 3-Dimension," 03/29 2008. P. Aliquippa and Pennsylvania, "THEMATIC KNIGHT'S TOUR QUOTES," 06/29 2020. A. Philip, "A Generalized Pseudo-Knight?s Tour Algorithm for Encryption of an Image," IEEE Potentials, vol. 32, no. 6, pp. 10-16, 2013. J. Kumar and S. Nirmala, "Securing the contents of document images using knight moves and genetic approach," in 2015 International Conference on Advances in Computing, Communications and Informatics (ICACCI), 2015, pp. 1091-1095.
  4. J. Delei, B. Sen, and D. Wenming, "An Image Encryption Algorithm Based on Knight's Tour and Slip Encryption-Filter," in 2008 International Conference on Computer Science and Software Engineering, 2008, vol. 1, pp. 251-255.
  5. M. Singh, A. Kakkar, and M. Singh, "Image Encryption Scheme Based on Knight's Tour Problem," Procedia Computer Science, vol. 70, pp. 245-250, 12/31 2015.
  6. Q. B. Hou, X. F. Yang, Y. S. Wang, and X. S. Huang, "An image scrambling algorithm based on wavelet transform and Knight's tour," vol. 41, pp. 369-375, 02/01 2004. D. C. Fisher, "On the n x n Knight Cover Problem," Ars Comb., vol. 69, / 2003. F. Rubin, "Improved Knight Coverings," Ars Comb., vol. 69, / 2003. F. Rubin, "Knight Covers for the 50x50 Chessboard," presented at the Mathfest 2004, Providence RI, 2004. F. Rubin, "A Family of Efficient Knight Covering Patterns," Journal of Recreational Mathematics, Article vol. 33, no. 3, pp. 165-175, 2005. F. Rubin, "An Improved Method for Finding Knight Covers," Ars Comb., vol. 82