Melola Discovery

← Melola Discovery

Open access Journal No SINTA rank

L(3,1)-Labeling of Double-Quadrilateral Windmill And Flower Graphs

Jurnal Matematika, Statistika dan Komputasi · Vol. 23 No. 1 (2026) · pp. 215–221

DOI
10.20956/n3zjqz22
ISSN
2614-8811, 1858-1382
Published
2026-09-15
Publisher
Department of Mathematics, Hasanuddin University
Language
en
License
creativecommons.org/licenses/by/4.0

Abstract

The L(3,1)-labeling of a graph is a distance-constrained labeling in which adjacent vertices receive labels differing by at least 3, while vertices at distance two receive labels differing by at least 1. The minimum span among all such labelings, denoted by λ_3,1 (G), is called the L(3,1)-labeling number of G. In this paper, we determine the exact L(3,1)-labeling numbers of double-quadrilateral windmill graphs and double-quadrilateral flower graphs. By constructing feasible labelings and establishing sharp lower bounds, we prove that λ_3,1 (DQ_k)=3k+2 and λ_3,1 (FDQ_k)=2k+3 for every integer k≥2. These results provide the first L(3,1)-labeling characterization of these graph families and contribute to the study of distance-constrained graph labeling on graphs composed of interconnected quadrilateral cycles.

Keywords

Collaboration network of the authors

4 authors · 6 co-authorship links

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

  • Universitas Al-Falah As-Sunniyah
  • Affiliation unknown
  • 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://journal.unhas.ac.id/index.php/jmsk/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">L(3,1)-Labeling of Double-Quadrilateral Windmill And Flower Graphs</dc:title>
	<dc:creator xml:lang="en">Komarullah, Hafif</dc:creator>
	<dc:creator xml:lang="en">Rosyidah, Siti Zulfa</dc:creator>
	<dc:creator xml:lang="en">Nurfadila, Rizqy Amalia</dc:creator>
	<dc:creator xml:lang="en">Afifah, Mifdati</dc:creator>
	<dc:subject xml:lang="en">L(3,1)-labeling</dc:subject>
	<dc:subject xml:lang="en">double-quadrilateral windmill graph</dc:subject>
	<dc:subject xml:lang="en">double-quadrilateral flower graph</dc:subject>
	<dc:subject xml:lang="en">Graph theory</dc:subject>
	<dc:description xml:lang="en">The L(3,1)-labeling of a graph is a distance-constrained labeling in which adjacent vertices receive labels differing by at least 3, while vertices at distance two receive labels differing by at least 1. The minimum span among all such labelings, denoted by λ_3,1 (G), is called the L(3,1)-labeling number of G. In this paper, we determine the exact L(3,1)-labeling numbers of double-quadrilateral windmill graphs and double-quadrilateral flower graphs. By constructing feasible labelings and establishing sharp lower bounds, we prove that λ_3,1 (DQ_k)=3k+2 and λ_3,1 (FDQ_k)=2k+3 for every integer k≥2. These results provide the first L(3,1)-labeling characterization of these graph families and contribute to the study of distance-constrained graph labeling on graphs composed of interconnected quadrilateral cycles.</dc:description>
	<dc:publisher xml:lang="en">Department of Mathematics, Hasanuddin University</dc:publisher>
	<dc:date>2026-09-15</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en">text</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.unhas.ac.id/index.php/jmsk/article/view/52305</dc:identifier>
	<dc:identifier>10.20956/n3zjqz22</dc:identifier>
	<dc:source xml:lang="en">Jurnal Matematika, Statistika dan Komputasi; Vol. 23 No. 1 (2026): September 2026; 215-221</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/52305/15016</dc:relation>
	<dc:coverage xml:lang="en"> Not Applicable</dc:coverage>
	<dc:rights xml:lang="en">Copyright (c) 2026 Jurnal Matematika, Statistika dan Komputasi</dc:rights>
	<dc:rights xml:lang="en">https://creativecommons.org/licenses/by/4.0</dc:rights>
</oai_dc:dc>