Melola Discovery

← Melola Discovery

Akses terbuka Jurnal

The Non-Isolated Domination Number of a Graph

Jurnal Matematika, Statistika dan Komputasi · Vol. 21 No. 3 (2025) · hlm. 786–795

DOI
10.20956/j.v21i3.43474
ISSN
2614-8811, 1858-1382
Terbit
2025-05-14
Penerbit
Department of Mathematics, Hasanuddin University
Bahasa
en
Lisensi
creativecommons.org/licenses/by/4.0

Abstrak

A subset S of the vertex set V (G) of a graph G is said to be a dominating set if every vertex not in S is adjacent to at least one vertex in S. In this research, we introduce a new domination parameter called the non-isolated domination number of a graph. A subset S of V of a nontrivial graph G is said to be a non-isolated dominating set if S is a dominating set and there are no zero-degree vertices in the subgraph induced by S. The minimum cardinality taken over all non-isolated dominating sets is called the non-isolated domination number and is denoted by γI. In this research, we obtained lower and upper bounds for the non-isolated domination number of a connected graph. We also determine the characterization of connected graphs that have the non-isolated domination numbers 2 and 3. Furthermore, we determine the non-isolated domination number of complete, n-partite complete, wheel, fan, star, cycle, and path graphs. We also determine the characterization of tree graphs that have the non-isolated domination number 2γ.

Kata kunci

Jaringan kolaborasi para penulis

7 penulis · 8 tautan kepenulisan bersama · 3 lintas organisasi

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

  • Bandung Institute of Technology
  • Riau University
  • Politeknik Negeri Malang
  • Sunan Gunung Djati State Islamic University Bandung
  • Afiliasi tidak diketahui
  • 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
Ratnaning PalupiPoliteknik Negeri Malang1
Edy Tri BaskoroBandung Institute of Technology1
Hajo J. BroersmaBandung Institute of Technology1
Hilda AssiyatunAfiliasi tidak diketahui1
Rismawati RamdaniSunan Gunung Djati State Islamic University Bandung1

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">The Non-Isolated Domination Number of a Graph</dc:title>
	<dc:creator xml:lang="en">Agustiarini, Efni</dc:creator>
	<dc:creator xml:lang="en">Salman, A.N.M.</dc:creator>
	<dc:subject xml:lang="en">dominating number</dc:subject>
	<dc:subject xml:lang="en">isolated vertex</dc:subject>
	<dc:subject xml:lang="en">non-isolated domination number</dc:subject>
	<dc:subject xml:lang="en">dominating set</dc:subject>
	<dc:description xml:lang="en">A subset S of the vertex set V (G) of a graph G is said to be a dominating set if every vertex not in S is adjacent to at least one vertex in S. In this research, we introduce a new domination parameter called the non-isolated domination number of a graph. A subset S of V of a nontrivial graph G is said to be a non-isolated dominating set if S is a dominating set and there are no zero-degree vertices in the subgraph induced by S. The minimum cardinality taken over all non-isolated dominating sets is called the non-isolated domination number and is denoted by γI. In this research, we obtained lower and upper bounds for the non-isolated domination number of a connected graph. We also determine the characterization of connected graphs that have the non-isolated domination numbers 2 and 3. Furthermore, we determine the non-isolated domination number of complete, n-partite complete, wheel, fan, star, cycle, and path graphs. We also determine the characterization of tree graphs that have the non-isolated domination number 2γ.</dc:description>
	<dc:publisher xml:lang="en">Department of Mathematics, Hasanuddin University</dc:publisher>
	<dc:date>2025-05-14</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.unhas.ac.id/index.php/jmsk/article/view/43474</dc:identifier>
	<dc:identifier>10.20956/j.v21i3.43474</dc:identifier>
	<dc:source xml:lang="en">Jurnal Matematika, Statistika dan Komputasi; Vol. 21 No. 3 (2025): MAY 2025; 786-795</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/43474/12807</dc:relation>
	<dc:rights xml:lang="en">Copyright (c) 2025 Jurnal Matematika, Statistika dan Komputasi</dc:rights>
	<dc:rights xml:lang="en">https://creativecommons.org/licenses/by/4.0</dc:rights>
</oai_dc:dc>