Melola Discovery

← Melola Discovery

Jurnal SINTA 1

On The Total Irregularity Strength of Regular Graphs

Journal of Mathematical and Fundamental Sciences · Vol. 47 No. 3 (2015) · hlm. 281–295

DOI
10.5614/j.math.fund.sci.2015.47.3.6
ISSN
2338-5510, 2337-5760
Terbit
2015-12-01
Penerbit
Directorate for Research and Innovation (DRI) ITB
Bahasa
eng

Abstrak

Let 𝐺 = (𝑉, 𝐸) be a graph. A total labeling 𝑓: 𝑉 ∪ 𝐸 → {1, 2, ⋯, 𝑘} iscalled a totally irregular total 𝑘-labeling of 𝐺 if every two distinct vertices 𝑥 and𝑦 in 𝑉 satisfy 𝑤𝑓(𝑥) ≠𝑤𝑓(𝑦) and every two distinct edges 𝑥1𝑥2 and 𝑦1𝑦2 in 𝐸satisfy 𝑤𝑓(𝑥1𝑥2) ≠𝑤𝑓(𝑦1𝑦2), where 𝑤𝑓(𝑥) = 𝑓(𝑥) + Σ𝑥𝑧∈𝐸(𝐺) 𝑓(𝑥𝑧) and𝑤𝑓(𝑥1𝑥2) = 𝑓(𝑥1) + 𝑓(𝑥1𝑥2) + 𝑓(𝑥2). The minimum 𝑘 for which a graph 𝐺 hasa totally irregular total 𝑘-labeling is called the total irregularity strength of 𝐺,denoted by 𝑡𝑠(𝐺). In this paper, we consider an upper bound on the totalirregularity strength of 𝑚 copies of a regular graph. Besides that, we give a dual labeling of a totally irregular total 𝑘-labeling of a regular graph and we consider the total irregularity strength of 𝑚 copies of a path on two vertices, 𝑚 copies of a cycle, and 𝑚 copies of a prism 𝐶𝑛 □ 𝑃2.

Kata kunci

Jaringan kolaborasi para penulis

15 penulis · 24 tautan kepenulisan bersama · 3 lintas organisasi

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

  • Sunan Gunung Djati State Islamic University Bandung
  • Bandung Institute of Technology
  • Politeknik Negeri Malang
  • Riau University
  • 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
Ratnaning PalupiPoliteknik Negeri Malang1
Efni AgustiariniRiau University1
Nisa Nur ArafahSunan Gunung Djati State Islamic University Bandung1
Arief Fatchul HudaSunan Gunung Djati State Islamic University Bandung1
Arief Fathcul HudaAfiliasi tidak diketahui1
Asep Solih AwalluddinSunan Gunung Djati State Islamic University Bandung1
Esih SukaesihSunan Gunung Djati State Islamic University Bandung1
Selvi MarcelinaSunan Gunung Djati State Islamic University Bandung1
Desi Laswati SuwandiSunan Gunung Djati State Islamic University Bandung1
Salwa NursyahidaSunan Gunung Djati State Islamic University Bandung1
Edy Tri BaskoroBandung Institute of Technology1
Hajo J. BroersmaBandung 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) https://journals.itb.ac.id/index.php/jmfs/oai, pertama di-harvest 9 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 The Total Irregularity Strength of Regular Graphs</dc:title>
	<dc:creator>Ramdani, Rismawati</dc:creator>
	<dc:creator>Salman, A.N.M.</dc:creator>
	<dc:creator>Assiyatun, Hilda</dc:creator>
	<dc:subject xml:lang="en-US">cycle</dc:subject>
	<dc:subject xml:lang="en-US">dual labeling</dc:subject>
	<dc:subject xml:lang="en-US">path</dc:subject>
	<dc:subject xml:lang="en-US">prism</dc:subject>
	<dc:subject xml:lang="en-US">regular graph</dc:subject>
	<dc:subject xml:lang="en-US">the total irregularity strength</dc:subject>
	<dc:subject xml:lang="en-US">totally irregular total k-labeling.</dc:subject>
	<dc:description xml:lang="en-US">Let 𝐺 = (𝑉, 𝐸) be a graph. A total labeling 𝑓: 𝑉 ∪ 𝐸 → {1, 2, ⋯ , 𝑘} iscalled a totally irregular total 𝑘-labeling of 𝐺 if every two distinct vertices 𝑥 and𝑦 in 𝑉 satisfy 𝑤𝑓(𝑥) ≠ 𝑤𝑓(𝑦) and every two distinct edges 𝑥1𝑥2 and 𝑦1𝑦2 in 𝐸satisfy 𝑤𝑓(𝑥1𝑥2) ≠ 𝑤𝑓(𝑦1𝑦2), where 𝑤𝑓(𝑥) = 𝑓(𝑥) + Σ𝑥𝑧∈𝐸(𝐺) 𝑓(𝑥𝑧) and𝑤𝑓(𝑥1𝑥2) = 𝑓(𝑥1) + 𝑓(𝑥1𝑥2) + 𝑓(𝑥2). The minimum 𝑘 for which a graph 𝐺 hasa totally irregular total 𝑘-labeling is called the total irregularity strength of 𝐺,denoted by 𝑡𝑠(𝐺). In this paper, we consider an upper bound on the totalirregularity strength of 𝑚 copies of a regular graph. Besides that, we give a dual labeling of a totally irregular total 𝑘-labeling of a regular graph and we consider the total irregularity strength of 𝑚 copies of a path on two vertices, 𝑚 copies of a cycle, and 𝑚 copies of a prism 𝐶𝑛 □ 𝑃2.</dc:description>
	<dc:publisher xml:lang="en-US">Directorate for Research and Innovation (DRI) ITB</dc:publisher>
	<dc:date>2015-12-01</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://journals.itb.ac.id/index.php/jmfs/article/view/1253</dc:identifier>
	<dc:identifier>10.5614/j.math.fund.sci.2015.47.3.6</dc:identifier>
	<dc:source xml:lang="en-US">Journal of Mathematical and Fundamental Sciences; Vol. 47 No. 3 (2015); 281-295</dc:source>
	<dc:source>2338-5510</dc:source>
	<dc:source>2337-5760</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journals.itb.ac.id/index.php/jmfs/article/view/1253/1062</dc:relation>
</oai_dc:dc>