Melola Discovery

← Melola Discovery

Open access Journal SINTA 3

THE LOCATING RAINBOW EDGE CONNECTION NUMBERS OF SOME GENERALIZED SUN GRAPHS

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 20 No. 4 (2026) · pp. 3519–3532

DOI
10.30598/barekengvol20iss4pp3519-3532
ISSN
2615-3017, 1978-7227
Published
2026-08-24
Publisher
PATTIMURA UNIVERSITY
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

Throughout this paper, G denotes a finite, simple, connected, and undirected graph. The concept of the locating rainbow edge connection number is motivated by the concept of the locating rainbow connection number in which the coloring is assigned to edges while preserving the locating property. The coloring focuses on determining the smallest natural number k such that there exists a locating rainbow edge -coloring of a graph such that every edge has a distinct rainbow code. In this paper, we define standard generalized sun graphs and leveled generalized sun graphs. We determine their locating rainbow edge connection numbers. The results are obtained through a theoretical approach and observations of graph structures with rigorous mathematical proofs. The results of Sun(n,p) and depend on their cycle order and the number of bridges.

Collaboration network of the authors

3 authors · 3 co-authorship links

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

  • Bandung Institute of Technology
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles

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 15 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">THE LOCATING RAINBOW EDGE CONNECTION NUMBERS OF SOME GENERALIZED SUN GRAPHS</dc:title>
	<dc:creator>Yusuf, Muhammad Ahnaf</dc:creator>
	<dc:creator>Salman, A. N. M.</dc:creator>
	<dc:creator>Mukayis, Mukayis</dc:creator>
	<dc:description xml:lang="en-US">Throughout this paper, G denotes a finite, simple, connected, and undirected graph. The concept of the locating rainbow edge connection number is motivated by the concept of the locating rainbow connection number in which the coloring is assigned to edges while preserving the locating property. The coloring focuses on determining the smallest natural number k such that there exists a locating rainbow edge  -coloring of a graph such that every edge has a distinct rainbow code. In this paper, we define standard generalized sun graphs  &amp;nbsp;and leveled generalized sun graphs  . We determine their locating rainbow edge connection numbers. The results are obtained through a theoretical approach and observations of graph structures with rigorous mathematical proofs. The results of Sun(n,p) and  depend on their cycle order and the number of bridges. </dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2026-08-24</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/23012</dc:identifier>
	<dc:identifier>10.30598/barekengvol20iss4pp3519-3532</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 20 No 4 (2026): BAREKENG: Journal of Mathematics and Its Application; 3519-3532</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol20iss4year2026</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/23012/13180</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2026 Muhammad Ahnaf Yusuf, A. N. M. Salman, Mukayis Mukayis</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>