Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Electronic Journal of Graph Theory and Applications (EJGTA)

Totally irregular total labeling of some caterpillar graphs Diari Indriati; W. Widodo; Indah E. Wijayanti; Kiki A. Sugeng; Isnaini Rosyida
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 8, No 2 (2020): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2020.8.2.5

Abstract

Assume that G(V,E) is a graph with V and E as its vertex and edge sets, respectively. We have G is simple, connected, and undirected. Given a function λ from a union of V and E into a set of k-integers from 1 until k. We call the function λ as a totally irregular total k-labeling if the set of weights of vertices and edges consists of different numbers. For any u ∈ V, we have a weight wt(u)=λ(u)+ ∑{uy ∈ E} λ(uy). Also, it is defined a weight wt(e)= λ(u)+ λ(uv) + λ(v) for each e=uv ∈ E. A minimum k used in k-total labeling λ is named as a total irregularity strength of G, symbolized by ts(G). We discuss results on ts of some caterpillar graphs in this paper. The results are ts(S{p,2,2,q}) = ⌈ (p+q-1)/2 ⌉ for p, q greater than or equal to 3, while ts(S{p,2,2,2,p}) = ⌈(2p-1)/2 ⌉, p ≥ 4.
Total distance vertex irregularity strength of some corona product graphs Dian Eka Wijayanti; Noor Hidayat; Diari Indriati; Abdul Rouf Alghofari; Slamin Slamin
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 11, No 1 (2023): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2023.11.1.17

Abstract

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.