Melola Discovery

← Melola Discovery

Akses terbuka Jurnal Tanpa peringkat SINTA

Connectivity of Non-Coprime Graph over Dihedral Group

Jurnal Matematika, Statistika dan Komputasi · Vol. 23 No. 1 (2026) · hlm. 195–202

DOI
10.20956/y76mg453
ISSN
2614-8811, 1858-1382
Terbit
2026-09-15
Penerbit
Department of Mathematics, Hasanuddin University
Bahasa
en
Lisensi
creativecommons.org/licenses/by/4.0

Abstrak

Let Γ be the non-coprime graph of the dihedral group of order 2n. This research investigates the connectivity properties of Γ, particularly its Eulerian, semi-Eulerian, Hamiltonian, and planar properties. The research begins by examining several properties related to the dihedral group, and then identifying the connectivity patterns that are formed in the non-coprime graph through the analysis of the order of elements in the group. These patterns then serve as the basis for determining its connectivity properties. The results show that Γ is Eulerian when n = 2k, where k ≥ 2, and semi-Eulerian if and only if n = 2p, where p is an odd prime. Furthermore, the graph is Hamiltonian for n = 2k or n = 2p, where p is an odd prime. In addition, the graph is planar if and only if n = 2 or n = 3. These results indicate that the factorization form of n strongly influences the connectivity structure and graph properties of the non-coprime graph over the dihedral group.

Kata kunci

Jaringan kolaborasi para penulis

2 penulis · 1 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Sunan Kalijaga State Islamic University Yogyakarta
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://journal.unhas.ac.id/index.php/jmsk/oai, pertama di-harvest 5 Nov 2026, terakhir terlihat 15 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en">Connectivity of Non-Coprime Graph over Dihedral Group</dc:title>
	<dc:creator xml:lang="en">Wahyuni, Winda Cahya Dwi</dc:creator>
	<dc:creator xml:lang="en">Munandar, Arif</dc:creator>
	<dc:subject xml:lang="en">Non Coprime Graph</dc:subject>
	<dc:subject xml:lang="en">dihedral group</dc:subject>
	<dc:subject xml:lang="en">Eulerian Graph</dc:subject>
	<dc:subject xml:lang="en">hamiltonian graph</dc:subject>
	<dc:subject xml:lang="en">Planarity</dc:subject>
	<dc:subject xml:lang="en">Computational Mathematics</dc:subject>
	<dc:description xml:lang="en">Let Γ be the non-coprime graph of the dihedral group of order 2n. This research investigates the connectivity properties of Γ, particularly its Eulerian, semi-Eulerian, Hamiltonian, and planar properties. The research begins by examining several properties related to the dihedral group, and then identifying the connectivity patterns that are formed in the non-coprime graph through the analysis of the order of elements in the group. These patterns then serve as the basis for determining its connectivity properties. The results show that Γ is Eulerian when n = 2k, where k ≥ 2, and semi-Eulerian if and only if n = 2p, where p is an odd prime. Furthermore, the graph is Hamiltonian for n = 2k or n = 2p, where p is an odd prime. In addition, the graph is planar if and only if n = 2 or n = 3. These results indicate that the factorization form of n strongly influences the connectivity structure and graph properties of the non-coprime graph over the dihedral group.</dc:description>
	<dc:publisher xml:lang="en">Department of Mathematics, Hasanuddin University</dc:publisher>
	<dc:date>2026-09-15</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en">text</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.unhas.ac.id/index.php/jmsk/article/view/52213</dc:identifier>
	<dc:identifier>10.20956/y76mg453</dc:identifier>
	<dc:source xml:lang="en">Jurnal Matematika, Statistika dan Komputasi; Vol. 23 No. 1 (2026): September 2026; 195-202</dc:source>
	<dc:source>2614-8811</dc:source>
	<dc:source>1858-1382</dc:source>
	<dc:language>en</dc:language>
	<dc:relation>https://journal.unhas.ac.id/index.php/jmsk/article/view/52213/15014</dc:relation>
	<dc:coverage xml:lang="en">Not Applicable</dc:coverage>
	<dc:rights xml:lang="en">Copyright (c) 2026 Jurnal Matematika, Statistika dan Komputasi</dc:rights>
	<dc:rights xml:lang="en">https://creativecommons.org/licenses/by/4.0</dc:rights>
</oai_dc:dc>