Melola Discovery

← Melola Discovery

Jurnal SINTA 1

On cycle-irregularity strength of ladders and fan graphs

Electronic Journal of Graph Theory and Applications · Vol. 8 No. 1 (2020) · hlm. 181–194

DOI
10.5614/ejgta.2020.8.1.13
ISSN
2338-2287
Terbit
2020-04-01
Penerbit
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
Bahasa
eng

Abstrak

A simple graph G = (V(G),E(G)) admits an H-covering if every edge in E(G) belongs to at least one subgraph of G isomorphic to a given graph H. A total k-labeling φ: V(G) ∪ E(G) → {1,2,..., k} is called to be an H-irregular total k-labeling of the graph G admitting an H-covering if for every two different subgraphs H' and H" isomorphic to H there is wtφ(H') ≠ wtφ(H"), where wtφ(H)= ∑v ∈ V(H) φ(v) + ∑e ∈ E(H) φ(e). The total H-irregularity strength of a graph G, denoted by ths(G,H), is the smallest integer k such that G has an H-irregular total k-labeling. In this paper we determine the exact value of the cycle-irregularity strength of ladders and fan graphs.

Kata kunci

Jaringan kolaborasi para penulis

8 penulis · 12 tautan kepenulisan bersama · 2 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Bandung Institute of Technology
  • Politeknik Negeri Bandung
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
SeprianusAfiliasi tidak diketahui1
Nuning NurainiBandung Institute of Technology1
Anie LusianiPoliteknik Negeri Bandung1
Edy Tri BaskoroBandung Institute of Technology1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) http://www.ejgta.org/index.php/ejgta/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 16 Nov 2026.
Metadata asli (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 cycle-irregularity strength of ladders and fan graphs</dc:title>
	<dc:creator>Ashraf, Faraha; GC University Lahore</dc:creator>
	<dc:creator>Baca, Martin; Technical University of Kosice</dc:creator>
	<dc:creator>Semanicova-Fenovcikova, Andrea; Technical University of Kosice</dc:creator>
	<dc:creator>Saputro, Suhadi Wido; ITB Indonesia</dc:creator>
	<dc:subject xml:lang="en-US">total $H$-irregular labeling,  total cycle-irregularity strength, ladder, fan graph</dc:subject>
	<dc:description xml:lang="en-US">A simple graph G = (V(G),E(G)) admits an H-covering if every edge in E(G) belongs to at least one subgraph of G isomorphic to a given graph H. A total k-labeling φ : V(G) ∪ E(G) → {1,2,..., k} is called to be an H-irregular total k-labeling of the graph G admitting an H-covering if for every two different subgraphs H' and H" isomorphic to H there is wtφ(H') ≠ wtφ(H"), where wtφ(H)= ∑v ∈ V(H) φ(v) + ∑e ∈ E(H) φ(e). The total H-irregularity strength of a graph G, denoted by ths(G,H), is the smallest integer k such that G has an H-irregular total k-labeling. In this paper we determine the exact value of the cycle-irregularity strength of ladders and fan graphs.</dc:description>
	<dc:publisher xml:lang="en-US">GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB</dc:publisher>
	<dc:contributor xml:lang="en-US">APVV</dc:contributor>
	<dc:contributor xml:lang="en-US">VEGA</dc:contributor>
	<dc:contributor xml:lang="en-US">ITB</dc:contributor>
	<dc:date>2020-04-01</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-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>http://www.ejgta.org/index.php/ejgta/article/view/449</dc:identifier>
	<dc:identifier>10.5614/ejgta.2020.8.1.13</dc:identifier>
	<dc:source xml:lang="en-US">Electronic Journal of Graph Theory and Applications (EJGTA); Vol 8, No 1 (2020): Electronic Journal of Graph Theory and Applications; 181 - 194</dc:source>
	<dc:source>2338-2287</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>http://www.ejgta.org/index.php/ejgta/article/view/449/pdf_133</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2020 Electronic Journal of Graph Theory and Applications (EJGTA)</dc:rights>
</oai_dc:dc>