Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 3

RAINBOW VERTEX-CONNECTION NUMBER ON COMB PRODUCT OPERATION OF CYCLE GRAPH (C_4) AND COMPLETE BIPARTITE GRAPH (K_(3,N))

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 17 No. 2 (2023) · pp. 0673–0684

DOI
10.30598/barekengvol17iss2pp0673-0684
ISSN
2615-3017, 1978-7227
Published
2023-06-11
Publisher
PATTIMURA UNIVERSITY
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

Rainbow vertex-connection number is the minimum colors assignment to the vertices of the graph, such that each vertex is connected by a path whose edges have distinct colors and is denoted by. The rainbow vertex connection number can be applied to graphs resulting from operations. One of the methods to create a new graph is to perform operations between two graphs. Thus, this research uses comb product operation to determine rainbow-vertex connection number resulting from comb product operation of cycle graph and complete bipartite graph &. The research finding obtains the theorem of rainbow vertex-connection number at the graph of for while the theorem of rainbow vertex-connection number at the graph of for for.

Collaboration network of the authors

29 authors · 76 co-authorship links

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

  • Universitas Sulawesi Tenggara
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Muhammad Rezky Friesta PayuAffiliation unknown4
Djihad WungguliAffiliation unknown3
Ismail DjakariaAffiliation unknown2
Jefri N. IsaAffiliation unknown2
Stella JunusAffiliation unknown2
Arsalim ArsalimUniversitas Sulawesi Tenggara1
Humairah MuljabarUniversitas Sulawesi Tenggara1
Erfain ErfainAffiliation unknown1
Imran ImranAffiliation unknown1
Monalisa Herawati RumayarAffiliation unknown1
Muh. Ridawan AdnanAffiliation unknown1
Fauzan FauzanAffiliation unknown1
Zulkifli AlamtahaAffiliation unknown1
Mohamad Rivaldi KoniAffiliation unknown1
Dewi Rahmawaty IsaAffiliation unknown1
Rosna Ningsih BilondatuAffiliation unknown1
Moh Rizal HusainAffiliation unknown1
Resmawan ResmawanAffiliation unknown1
Rahmayunda UsaliAffiliation unknown1
Franky Alfrits OrohAffiliation unknown1
Sumarno IsmailAffiliation unknown1
Isran K. HasanAffiliation unknown1
Tesya SigarAffiliation unknown1
Muhammad Rezky F. PayuAffiliation unknown1
Melisa HuntalaAffiliation 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://ojs3.unpatti.ac.id/index.php/barekeng/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-US">RAINBOW VERTEX-CONNECTION NUMBER ON COMB PRODUCT OPERATION OF CYCLE GRAPH (C_4) AND COMPLETE BIPARTITE GRAPH (K_(3,N))</dc:title>
	<dc:creator>Yahya, Nisky Imansyah</dc:creator>
	<dc:creator>Fatmawati, Ainun</dc:creator>
	<dc:creator>Nurwan, Nurwan</dc:creator>
	<dc:creator>Nasib, Salmun K</dc:creator>
	<dc:description xml:lang="en-US">Rainbow vertex-connection number is the minimum colors assignment to the vertices of the graph, such that each vertex is connected by a path whose edges have distinct colors and is denoted by  . The rainbow vertex connection number can be applied to graphs resulting from operations. One of the methods to create a new graph is to perform operations between two graphs. Thus, this research uses comb product operation to determine rainbow-vertex connection number resulting from comb product operation of cycle graph and complete bipartite graph  &amp;nbsp;&amp;amp;  . The research finding obtains the theorem of rainbow vertex-connection number at the graph of  &amp;nbsp;for  &amp;nbsp;while the theorem of rainbow vertex-connection number at the graph of  &amp;nbsp;for  &amp;nbsp;for  .</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2023-06-11</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://ojs3.unpatti.ac.id/index.php/barekeng/article/view/7008</dc:identifier>
	<dc:identifier>10.30598/barekengvol17iss2pp0673-0684</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 17 No 2 (2023): BAREKENG: Journal of Mathematics and Its Applications; 0673-0684</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol17iss2year2023</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/7008/5929</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2023 Nisky Imansyah Yahya, Ainun Fatmawati, Nurwan Nurwan, Salmun K Nasib</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>