Melola Discovery

← Melola Discovery

Journal

Partition Dimension of Complete Multipartite Graph

Jurnal Matematika, Statistika dan Komputasi · Vol. 16 No. 3 (2020) · pp. 365–374

DOI
10.20956/jmsk.v16i3.7278
ISSN
2614-8811, 1858-1382
Published
2020-04-28
Publisher
Department of Mathematics, Hasanuddin University
Language
en

Abstract

Determining a resolving partition of a graph is an interesting study in graph theory due to many applications like censor design, compound classification in chemistry, robotic navigation and internet network. Let and, the distance between an is. For an ordered partition of, the representation of with respect to is. The partition is called a resolving partition of if all representation of vertices are distinct. The partition dimension of graph is the smallest integer such that has a resolving partition with element.In this thesis, we determine the partition dimension of complete multipartite graph, which is limited by, with and. We found that,, and,.

Keywords

Collaboration network of the authors

40 authors · 118 co-authorship links · 3 across different organisations · showing the 40 most connected

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Universitas Halu Oleo
  • Telkom University
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Budi NurwahyuAffiliation unknown3
Ahmad Syukur DamingAffiliation unknown3
Hardiyanti MunsiAffiliation unknown2
Pawennari HijjangAffiliation unknown2
Amir Kamal AmirAffiliation unknown2
Ari Moesriami BarmawiTelkom University1
Rimba HamidUniversitas Halu Oleo1
Nana SumarnaUniversitas Halu Oleo1
La Ili La IliAffiliation unknown1
Aris BadaraUniversitas Halu Oleo1
Amirudin RahimAffiliation unknown1
Ida SriwatyAffiliation unknown1
Waode SuarniAffiliation unknown1
Saleh SalehAffiliation unknown1
La Ndia La NdiaAffiliation unknown1
Jayana Suryana KembaraAffiliation unknown1
Sumarto M. LaluAffiliation unknown1
Wahyu ChandraAffiliation unknown1
Rahmat YasimAffiliation unknown1
Munsi LampeAffiliation unknown1
Andi SadapottoAffiliation unknown1
Haidir JibranAffiliation unknown1
Irfan Hakim MaridiAffiliation unknown1
Amanda Putri sAffiliation unknown1
Dhea Rizky MalindaAffiliation unknown1
Denaya Mutiara SalsaAffiliation unknown1
Dila Amelia PutriAffiliation unknown1
Vanessa J.A. PandelakiAffiliation unknown1
St. NurhalizaAffiliation unknown1
Ingke Ananda AriefAffiliation unknown1
Rezqytha Widya Sari RakhmatAffiliation unknown1
Erika PutriAffiliation unknown1
Armin Nur FajarAffiliation unknown1
Moh. Alief SuryabahriAffiliation unknown1
Rafdi Yudha JonaidiAffiliation unknown1
Arif AdityaAffiliation unknown1
Arman AfendiAffiliation unknown1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://journal.unhas.ac.id/index.php/jmsk/oai, first harvested 5 Nov 2026, last seen 5 Nov 2026.
Original metadata (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">Partition Dimension of Complete Multipartite Graph</dc:title>
	<dc:creator xml:lang="en">Safriadi, Safriadi</dc:creator>
	<dc:creator xml:lang="en">Hasmawati, Hasmawati</dc:creator>
	<dc:creator xml:lang="en">Haryanto, Loeky</dc:creator>
	<dc:subject xml:lang="en">multipartite graph</dc:subject>
	<dc:subject xml:lang="en">complete multipartite</dc:subject>
	<dc:subject xml:lang="en">partition set</dc:subject>
	<dc:subject xml:lang="en">resolving partition</dc:subject>
	<dc:subject xml:lang="en">partition dimension</dc:subject>
	<dc:description xml:lang="en">Determining a resolving partition of a graph is an interesting study in graph theory due to many applications like censor design, compound classification in chemistry, robotic navigation and internet network. Let  and , the distance between  an  is . For an ordered partition  of , the representation of  with respect to  is . The partition  is called a resolving partition of  if all representation of vertices are distinct. The partition dimension of graph  is the smallest integer  such that  has a resolving partition with  element.In this thesis, we determine the partition dimension of complete multipartite graph  ,  which is limited by , with  and . We found that , , and , .</dc:description>
	<dc:publisher xml:lang="en">Department of Mathematics, Hasanuddin University</dc:publisher>
	<dc:date>2020-04-28</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/7278</dc:identifier>
	<dc:identifier>10.20956/jmsk.v16i3.7278</dc:identifier>
	<dc:source xml:lang="en">Jurnal Matematika, Statistika dan Komputasi; Vol. 16 No. 3 (2020): JMSK, MAY, 2020; 365-374</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/7278/pdf</dc:relation>
	<dc:relation>10.20956/j.v16i3.7278.g5101</dc:relation>
	<dc:rights xml:lang="en">Copyright (c) 2020 Jurnal Matematika, Statistika dan Komputasi</dc:rights>
</oai_dc:dc>