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
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.
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
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>
Sitasi dan pengindeksan
Jumlah menurut tiap indeks pada 13 Nov 2026; setiap indeks menghitung sitasi dengan cara berbeda.
OpenAlex juga mencatat karya ini di: crossref, doaj.
Sitasi artikel ini
APA 7
Ramdani, R., Salman, A., & Assiyatun, H. (2015). On The Total Irregularity Strength of Regular Graphs. Journal of Mathematical and Fundamental Sciences, 47(3), 281–295. https://doi.org/10.5614/j.math.fund.sci.2015.47.3.6
Salin
IEEE
R. Ramdani, A. Salman, and H. Assiyatun, “On The Total Irregularity Strength of Regular Graphs,” Journal of Mathematical and Fundamental Sciences, vol. 47, no. 3, pp. 281–295, 2015, doi: 10.5614/j.math.fund.sci.2015.47.3.6.
Salin
Dibuat dari metadata jurnal; periksa nama penulis sebelum dipakai.