Melola Discovery

← Melola Discovery

Jurnal SINTA 1

Total distance vertex irregularity strength of some corona product graphs

Electronic Journal of Graph Theory and Applications · Vol. 11 No. 1 (2023) · hlm. 209–222

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

Abstrak

A distance vertex irregular total k-labeling of a simple undirected graph G = G(V, E), is a function f: V(G)∪E(G)→{1, 2, …, k} such that for every pair vertices u, v ∈ V(G) and u ≠ v, the weights of u and v are distinct. The weight of vertex v ∈ V(G) is defined to be the sum of the label of vertices in neighborhood of v and the label of all incident edges to v. The total distance vertex irregularity strength of G (denoted by tdis(G)) is the minimum of k for which G has a distance vertex irregular total k-labeling. In this paper, we present several results of the total distance vertex irregularity strength of some corona product graphs.

Kata kunci

Jaringan kolaborasi para penulis

7 penulis · 13 tautan kepenulisan bersama

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

  • University of Brawijaya
  • 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
Ardi Nur HidayatUniversity of Brawijaya1
Vira Hari KrisnawatiUniversity of Brawijaya1

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">Total distance vertex irregularity strength of some corona product graphs</dc:title>
	<dc:creator>Wijayanti, Dian Eka; Universitas Brawijaya
Universitas Ahmad Dahlan</dc:creator>
	<dc:creator>Hidayat, Noor; Universitas Brawijaya</dc:creator>
	<dc:creator>Indriati, Diari; Universitas Sebelas Maret</dc:creator>
	<dc:creator>Alghofari, Abdul Rouf; Universitas Brawijaya</dc:creator>
	<dc:creator>Slamin, Slamin; University of Jember</dc:creator>
	<dc:subject xml:lang="en-US">distance vertex irregular total k-labeling, total distance vertex irregularity strength</dc:subject>
	<dc:subject xml:lang="en-US">05C78</dc:subject>
	<dc:description xml:lang="en-US">A distance vertex irregular total k-labeling of a simple undirected graph G = G(V, E), is a function f : V(G)∪E(G)→{1, 2, …, k} such that for every pair vertices u, v ∈ V(G) and u ≠ v, the weights of u and v are distinct. The weight of vertex v ∈ V(G) is defined to be the sum of the label of vertices in neighborhood of v and the label of all incident edges to v. The total distance vertex irregularity strength of G (denoted by tdis(G)) is the minimum of k for which G has a distance vertex irregular total k-labeling. In this paper, we present several results of the total distance vertex irregularity strength of some corona product 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">Prof. Slamin, Department of Informatics, Universitas Jember, Indonesia</dc:contributor>
	<dc:date>2023-04-08</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/1473</dc:identifier>
	<dc:identifier>10.5614/ejgta.2023.11.1.17</dc:identifier>
	<dc:source xml:lang="en-US">Electronic Journal of Graph Theory and Applications (EJGTA); Vol 11, No 1 (2023): Electronic Journal of Graph Theory and Applications; 209 - 222</dc:source>
	<dc:source>2338-2287</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>http://www.ejgta.org/index.php/ejgta/article/view/1473/pdf_273</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2023 Electronic Journal of Graph Theory and Applications (EJGTA)</dc:rights>
</oai_dc:dc>