Claim Missing Document
Check
Articles

Found 3 Documents
Search
Journal : Indonesian Journal of Combinatorics

Computing total edge irregularity strength of some n-uniform cactus chain graphs and related chain graphs Isnaini Rosyida; Diari Indriati
Indonesian Journal of Combinatorics Vol 4, No 1 (2020)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2020.4.1.6

Abstract

Given graph G(V,E). We use the notion of total k-labeling which is edge irregular. The notion of total edge irregularity strength (tes) of graph G means the minimum integer k used in the edge irregular total k-labeling of G. A cactus graph G is a connected graph where no edge lies in more than one cycle. A cactus graph consisting of some blocks where each block is cycle Cn with same size n is named an n-uniform cactus graph. If each cycle of the cactus graph has no more than two cut-vertices and each cut-vertex is shared by exactly two cycles, then G is called n-uniform cactus chain graph. In this paper, we determine tes of n-uniform cactus chain graphs C(Cnr) of length r for some n ≡ 0 mod 3. We also investigate tes of related chain graphs, i.e. tadpole chain graphs Tr(4,n) and Tr(5,n) of length r. Our results are as follows: tes(C(Cnr)) = ⌈(nr + 2)/3⌉ ; tes(Tr(4,n)) = ⌈((5+n)r+2)/3⌉ ; tes(Tr(5,n)) = ⌈((5+n)r+2)/3⌉.
Edge irregular reflexive labeling on sun graph and corona of cycle and null graph with two vertices Irfan Setiawan; Diari Indriati
Indonesian Journal of Combinatorics Vol 5, No 1 (2021)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2021.5.1.5

Abstract

Let G(V,E) be a simple and connected graph which set of vertices is V and set of edges is E. Irregular reflexive k-labeling f on G(V,E) is assignment that carries the numbers of integer to elements of graph, such that the positive integer {1,2, 3,...,ke} assignment to edges of graph and the even positive integer {0,2,4,...,2kv} assignment to vertices of graph. Then, we called as edge irregular reflexive k-labelling if every edges has different weight with k = max{ke,2kv}. Besides that, there is definition of reflexive edge strength of G(V,E) denoted as res(G), that is a minimum k that using for labeling f on G(V,E). This paper will discuss about edge irregular reflexive k-labeling for sun graph and corona of cycle and null graph, denoted by Cn ⨀ N2 and make sure about their reflexive edge strengths.
Reflexive Edge Strength on Slanting Ladder Graph and Corona of Centipede and Null Graph Ispriyanto, Mochamad Raffli; Indriati, Diari; Utomo, Putranto Hadi
Indonesian Journal of Combinatorics Vol 8, No 2 (2024)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2024.8.2.3

Abstract

Assume G is a graph that is simple, undirected, and connected. If every edge label is a positive integer in the range 1 to ke, and every vertex label is a non-negative even number from 0 to 2kv, then a graph G is considered to have an edge irregular reflexive k-labeling, where k is defined as the maximum of ke and 2kv. The edge weight wt(ab) in the graph G, for the labeling λ, is defined as the function wt applied to the edge ab. The symbol res(G) denotes the reflexive edge strength, which is the largest label of the smallest k. The results of this research are as follows: res(SLm) for m≥2 is ⌈(3m−3)/3⌉ for 3m−3 ≢ 2, 3 (mod 6), and ⌈(3m−3)/3⌉+1 for 3m−3 ≡ 2, 3 (mod 6). res(Cpn ⊙ Nm) for n≥2, m≥1 is ⌈(2nm+2n−1)/3⌉ for 2nm+2n−1 ≢ 2, 3 (mod 6), and ⌈(2nm+2n−1)/3⌉+1 for 2nm+2n−1 ≡ 2, 3 (mod 6).