Melola Discovery

← Melola Discovery

Open access Jurnal

Rainbow Connection Number of Double Quadrilateral Snake Graph

Jurnal Matematika, Statistika dan Komputasi · Vol. 20 No. 1 (2023) · pp. 268–280

DOI
10.20956/j.v20i1.28141
ISSN
2614-8811, 1858-1382
Published
2023-09-06
Publisher
Department of Mathematics, Hasanuddin University
Language
en
License
creativecommons.org/licenses/by/4.0

Abstract

Let graph G = be a non trivial connected graph. A graph G with edge coloring is called a rainbow connection, if for every pair of vertices on a path has a different color. The rainbow connection number denoted by is the minimum color needed to make graph G rainbow connection. In this study, we will determine the rainbow connection number of double quadrilateral snake graph and alternate double quadrilateral snake graph. The research results show that while if and if

Keywords

Collaboration network of the authors

23 authors · 44 co-authorship links

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

  • Telkom University
  • State University of Makassar
  • Institut Agama Islam Muhammadiyah Sinjai
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Naimah ArisAffiliation unknown4
Muh NurAffiliation unknown2
Hasmawati HasmawatiTelkom University2
Ahmad Syukur DamingAffiliation unknown2
Heryati Nur Fatimah SariAffiliation unknown2
Khaeruddin KhaeruddinState University of Makassar1
Faisal FaisalAffiliation unknown1
Islamiyah AbbasAffiliation unknown1
Hasmawati BasirAffiliation unknown1
Theresia Alex RimaAffiliation unknown1
Muh. Ali ImranAffiliation unknown1
Asriadi AsriadiInstitut Agama Islam Muhammadiyah Sinjai1
Mawardi BahriAffiliation unknown1
Afif Budi Andy BAffiliation unknown1
Loeky HaryantoAffiliation unknown1
Aswad Hariri MangalaengAffiliation unknown1
Amir Kamal AmirAffiliation unknown1
Indi Ria Al KadryAffiliation unknown1
Dermawan SaputraAffiliation unknown1
Cindy CindyAffiliation 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">Rainbow Connection Number of Double Quadrilateral Snake Graph </dc:title>
	<dc:creator xml:lang="en">Yuniarti, Ervie Yuniarti Astika Mustafaputri</dc:creator>
	<dc:creator xml:lang="en">Nurwahyu , Budi </dc:creator>
	<dc:creator xml:lang="en">Massalesse, Jusmawati </dc:creator>
	<dc:subject xml:lang="en">Rainbow Connection Number</dc:subject>
	<dc:subject xml:lang="en">Double Quadrilateral Snake Graph</dc:subject>
	<dc:subject xml:lang="en">Alternate Double Quadrilateral Snake Graph</dc:subject>
	<dc:description xml:lang="en">Let graph G = be a non trivial connected graph. A graph G with edge coloring is called a rainbow connection, if for every pair of vertices  on a path has a different color. The rainbow connection number denoted by  is the minimum color needed to make graph G rainbow connection. In this study, we will determine the rainbow connection number of double quadrilateral snake graph and alternate double quadrilateral snake graph. The research results show that while   if  and  if
 </dc:description>
	<dc:publisher xml:lang="en">Department of Mathematics, Hasanuddin University</dc:publisher>
	<dc:date>2023-09-06</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/28141</dc:identifier>
	<dc:identifier>10.20956/j.v20i1.28141</dc:identifier>
	<dc:source xml:lang="en">Jurnal Matematika, Statistika dan Komputasi; Vol. 20 No. 1 (2023): SEPTEMBER, 2023; 268- 280</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/28141/10283</dc:relation>
	<dc:relation>10.20956/j.v20i1.28141.g10283</dc:relation>
	<dc:rights xml:lang="en">Copyright (c) 2023 Author and publisher</dc:rights>
	<dc:rights xml:lang="en">https://creativecommons.org/licenses/by/4.0</dc:rights>
</oai_dc:dc>