Araştırma Makalesi

The Modularity of Queen Graphs by Girvan-Newman Clustering Algorithm

Cilt: 7 Sayı: 12 2 Haziran 2020
Serkan Güldal *, Michael Lıpscomb , Murat Tanık
PDF İndir
Adıyaman Üniversitesi Mühendislik Bilimleri Dergisi Kapak Adıyaman Üniversitesi Mühendislik Bilimleri Dergisi
EN TR

The Modularity of Queen Graphs by Girvan-Newman Clustering Algorithm

Abstract

The clustering of a given data set is a technique widely utilized data analysis method by data scientists for technological applications. Some portion of the analysis define the relations between data, and strong relations are identified as sub-communities by means of clustering algorithms. The collected functional relations between the clusters’ nodes extract the uninvestigated network properties. In this study, we investigated the relational properties of Queen graphs (graph representation of N-Queens problem) by the Girvan-Newman Clustering algorithm. Our investigation showed that the highly symmetric degree of nodes does not lead the symmetry in the sub-communities. While the distinct number of degrees increases with respect to board size, the number of subcommunities increases irregularly. Additionally, the maximum modularity score increases slower than the number of subcommunities.

Keywords

Girvan-Newman,Queens Graph,N-Queens Problem

Kaynakça

  1. C. F. Gauß, H. C. Schumacher, and C. A. F. Peters, Briefwechsel zwischen. Altona: Esch, 1860.
  2. J. Gingsburg, "Gauss's arithmetrization of the problem of n queens," Scripta Math. 5, pp. 63-66, 1939.
  3. G. Polya, "Uber die 'doppelt-periodischen' losungen des n-damen-problems," Mathematische Unterhaltungen und Spiele, pp. 364-374, 1918.
  4. É. Lucas, Recreations mathematiques. Vol. 4. Paris: Blanchard, 1960.
  5. V. Torggler, P. Aumann, H. Ritsch, and W. Lechner, "A Quantum N-Queens Solver," Quantum, vol. 3, 03/02 2018.
  6. F. Souza and F. Mello, "N-Queens Problem Resolution Using the Quantum Computing Model," IEEE Latin America Transactions, vol. 15, pp. 534-540, 03/01 2017.
  7. A. Draa, S. Meshoul, H. Talbi, and M. Batouche, "A Quantum-Inspired Differential Evolution Algorithm for Solving the N-Queens Problem," Int. Arab J. Inf. Technol., vol. 7, pp. 21-27, 01/01 2010.
  8. S. Ss, R. Stephen, and V. Irudayaraj, "Survey on N-Queen Problem with Genetic Algorithm," INTERNATIONAL JOURNAL OF COMPUTER SCIENCES AND ENGINEERING, vol. 6, pp. 54-58, 03/01 2018.
  9. S. Nag and U. Sarkar, "An Adaptive Genetic Algorithm for Solving N-Queens Problem," 12/21 2017.
  10. E. Cengiz, S. Seyed, and T. Murat, "Different perspectives of the N-Queens problem," in Proceedings of the, A. C. M. annual conference Communications, ACM, 2 Penn Plaza, Suite 701, New York, NY 10121-0701, USA, 1992.

Ayrıntılar

Birincil Dil

İngilizce

Konular

Mühendislik

Bölüm

Araştırma Makalesi

Yazarlar

Michael Lıpscomb Bu kişi benim
United States

Murat Tanık Bu kişi benim
United States

Yayımlanma Tarihi

2 Haziran 2020

Gönderilme Tarihi

23 Mart 2020

Kabul Tarihi

12 Mayıs 2020

Yayımlandığı Sayı

Yıl 2020 Cilt: 7 Sayı: 12

IZ

https://izlik.org/JA58HG39CP

Kaynak Göster

RIS / Bibtex
APA
Güldal, S., Lıpscomb, M., & Tanık, M. (2020). The Modularity of Queen Graphs by Girvan-Newman Clustering Algorithm. Adıyaman Üniversitesi Mühendislik Bilimleri Dergisi, 7(12), 14-23. https://izlik.org/JA58HG39CP
AMA
1.Güldal S, Lıpscomb M, Tanık M. The Modularity of Queen Graphs by Girvan-Newman Clustering Algorithm. Adıyaman Üniversitesi Mühendislik Bilimleri Dergisi. 2020;7(12):14-23. https://izlik.org/JA58HG39CP
Chicago
Güldal, Serkan, Michael Lıpscomb, ve Murat Tanık. 2020. “The Modularity of Queen Graphs by Girvan-Newman Clustering Algorithm”. Adıyaman Üniversitesi Mühendislik Bilimleri Dergisi 7 (12): 14-23. https://izlik.org/JA58HG39CP.
EndNote
Güldal S, Lıpscomb M, Tanık M (01 Haziran 2020) The Modularity of Queen Graphs by Girvan-Newman Clustering Algorithm. Adıyaman Üniversitesi Mühendislik Bilimleri Dergisi 7 12 14–23.
IEEE
[1]S. Güldal, M. Lıpscomb, ve M. Tanık, “The Modularity of Queen Graphs by Girvan-Newman Clustering Algorithm”, Adıyaman Üniversitesi Mühendislik Bilimleri Dergisi, c. 7, sy 12, ss. 14–23, Haz. 2020, [çevrimiçi]. Erişim adresi: https://izlik.org/JA58HG39CP
ISNAD
Güldal, Serkan - Lıpscomb, Michael - Tanık, Murat. “The Modularity of Queen Graphs by Girvan-Newman Clustering Algorithm”. Adıyaman Üniversitesi Mühendislik Bilimleri Dergisi 7/12 (01 Haziran 2020): 14-23. https://izlik.org/JA58HG39CP.
JAMA
1.Güldal S, Lıpscomb M, Tanık M. The Modularity of Queen Graphs by Girvan-Newman Clustering Algorithm. Adıyaman Üniversitesi Mühendislik Bilimleri Dergisi. 2020;7:14–23.
MLA
Güldal, Serkan, vd. “The Modularity of Queen Graphs by Girvan-Newman Clustering Algorithm”. Adıyaman Üniversitesi Mühendislik Bilimleri Dergisi, c. 7, sy 12, Haziran 2020, ss. 14-23, https://izlik.org/JA58HG39CP.
Vancouver
1.Serkan Güldal, Michael Lıpscomb, Murat Tanık. The Modularity of Queen Graphs by Girvan-Newman Clustering Algorithm. Adıyaman Üniversitesi Mühendislik Bilimleri Dergisi [Internet]. 01 Haziran 2020;7(12):14-23. Erişim adresi: https://izlik.org/JA58HG39CP