Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 3

ON RAINBOW ANTIMAGIC COLORING OF SNAIL GRAPH(S_n ), COCONUT ROOT GRAPH (Cr_(n,m) ), FAN STALK GRAPH (Kt_n ) AND THE LOTUS GRAPH(Lo_n )

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 17 No. 3 (2023) · pp. 1543–1552

DOI
10.30598/barekengvol17iss3pp1543-1552
ISSN
2615-3017, 1978-7227
Published
2023-09-30
Publisher
PATTIMURA UNIVERSITY
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

Rainbow antimagic coloring is a combination of antimagic labeling and rainbow coloring. Antimagic labeling is labeling of each vertex of the graph with a different label, so that each the sum of the vertices in the graph has a different weight. Rainbow coloring is part of the rainbow-connected edge coloring, where each graph has a rainbow path. A rainbow path in a graph is formed if two vertices on the graph do not have the same color. If the given color on each edge is different, for example in the function it is colored with a weight, it is called rainbow antimagic coloring. Rainbow antimagic coloring has a condition that every two vertices on a graph cannot have the same rainbow path. The minimum number of colors from rainbow antimagic coloring is called the rainbow antimagic connection number, denoted by In this study, we analyze the rainbow antimagic connection number of snail graph, coconut root graph, fan stalk graph and lotus graph.

Collaboration network of the authors

19 authors · 49 co-authorship links · 2 across different organisations

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

  • Universitas Jember
  • Universitas Halu Oleo
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
ROBIATUL ADAWIYAHUniversitas Halu Oleo3
Ika Hesti AgustinUniversitas Jember2
Antonius Cahya PrihandokoUniversitas Jember1
R M PrihandiniAffiliation unknown1
M R RahmadaniAffiliation unknown1
Muhammad Ilham Nurfaizi AnnadhifiAffiliation unknown1
I Nengah SupartaAffiliation unknown1
Arika Indah KristianaAffiliation unknown1
Edy WihardjoAffiliation unknown1
Aji Mansur SantosoAffiliation unknown1
Saddam HussenAffiliation unknown1
Fitriyatul MardiyahAffiliation unknown1
Excelsa Suli Wildhatul JannahAffiliation unknown1
Marsidi MarsidiAffiliation 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">ON RAINBOW ANTIMAGIC COLORING OF SNAIL GRAPH(S_n ), COCONUT ROOT GRAPH (Cr_(n,m) ), FAN STALK GRAPH (Kt_n )  AND THE LOTUS GRAPH(Lo_n )</dc:title>
	<dc:creator>Adawiyah, R</dc:creator>
	<dc:creator>Makhfudloh, I I</dc:creator>
	<dc:creator>Dafik, Dafik</dc:creator>
	<dc:creator>Prihandini, RM</dc:creator>
	<dc:creator>Prihandoko, AC</dc:creator>
	<dc:description xml:lang="en-US">Rainbow antimagic coloring is a combination of antimagic labeling and rainbow coloring. Antimagic labeling is labeling of each vertex of the graph  &amp;nbsp;with a different label, so that each the sum of the vertices in the graph has a different weight. Rainbow coloring is part of the rainbow-connected edge coloring, where each graph  &amp;nbsp;has a rainbow path. A rainbow path in a graph  is formed if two vertices on the graph  &amp;nbsp;do not have the same color. If the given color on each edge is different, for example in the function  it is colored  &amp;nbsp;with a weight  , it is called rainbow antimagic coloring. Rainbow antimagic coloring has a condition that every two vertices on a graph cannot have the same rainbow path. The minimum number of colors from rainbow antimagic coloring is called the rainbow antimagic connection number, denoted by  &amp;nbsp;In this study, we analyze the rainbow antimagic&amp;nbsp; connection number of snail graph  , coconut root graph  , fan stalk graph  &amp;nbsp;and lotus graph  .</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2023-09-30</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/8458</dc:identifier>
	<dc:identifier>10.30598/barekengvol17iss3pp1543-1552</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 17 No 3 (2023): BAREKENG: Journal of Mathematics and Its Applications; 1543-1552</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol17iss3year2023</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/8458/6568</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2023 R Adawiyah, I I Makhfudloh, Dafik Dafik, RM Prihandini, AC Prihandoko</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>