Results 11 to 20 of about 597 (229)
On the total vertex irregularity strength of comb product of two cycles and two stars
Indonesian Journal of Combinatorics, 2020 Let G = (V(G),E(G)) be a graph and k be a positive integer. A total k-labeling of G is a map f : V ∪ E → {1,2,3,...,k}. The vertex weight v under the labeling f is denoted by w_f(v) and defined by w_f(v) = f(v) + \sum_{uv \in{E(G)}} {f(uv)}.
Rismawati Ramdani
doaj +3 more sources
On Total Vertex Irregularity Strength of Cocktail Party Graph
Jurnal Ilmu Dasar, 2011 A vertex irregular total k-labeling of a graph G is a function λ from both the vertex and the edge sets to {1,2,3,,k} such that for every pair of distinct vertices u and x, λ(u)+∑λ(uv)≠λ(x)+∑λ(xy). uv∈E xy∈E.
Kristiana Wijaya, S Slamin, Mirka Miller
doaj +1 more source
ON THE TOTAL VERTEX IRREGULARITY STRENGTH OF SERIES PARALLEL GRAPH sp(m,r,4)
Barekenghis study aims to determine the total vertex irregularity strength on a series parallel graph for and . Total labeling is said to be vertex irregular, if the weights for each vertices are different.
Corry Corazon Marzuki +3 more
doaj +2 more sources
Total edge irregularity strength of quadruplet and quintuplet book graphs [PDF]
ITM Web of Conferences, 2021 Let G= (V, E) be a finite, simple and undirected graph with a vertex set V and an edge set E. An edge irregular total k-labelling is a function f : V ᴗE → {1,2,…,k} such that for any two different edges xy and x’y’ in E, their weights are distinct.
Ratnasari Lucia +3 more
doaj +1 more source
A constructive method to determine the total vertex irregularity strength of two flower graph variants. [PDF]
MethodsXHinding N +6 more
europepmc +3 more sources
Modular total vertex irregularity strength of graphs
AIMS Mathematics, 2023 <abstract><p>A (modular) vertex irregular total labeling of a graph $ G $ of order $ n $ is an assignment of positive integers from $ 1 $ to $ k $ to the vertices and edges of $ G $ with the property that all vertex weights are distinct. The vertex weight of a vertex $ v $ is defined as the sum of numbers assigned to the vertex $ v $ itself
Gohar Ali +5 more
openaire +2 more sources
On irregularity strength of diamond network
AKCE International Journal of Graphs and Combinatorics, 2018 In this paper we investigate the total edge irregularity strength tes ( G ) and the total vertex irregularity strength tvs ( G ) of diamond graphs B r n and prove that tes ( B r n ) = ( 5 n − 3 ) ∕ 3 , while tvs ( B r n ) = ( n + 1 ) ∕ 3 .
Nurdin Hinding +4 more
doaj +2 more sources
Total Vertex Irregularity Strength Of Prismatic Graph Amalgamation
Jurnal Matematika, Statistika dan Komputasi, 2023 It is not possible to determine the total vertex of irregular strength of all graphs. This study aims to ascertain the total vertex irregularity strength in prismatic graph amalgamation for n>=4. Determination of the total vertex irregularity strength in prismatic graph amalgamation is done by ascertaining the largest lower limit and the smallest ...
Junianto Sesa, La Ode Muhlis
openaire +1 more source
The total distance vertex irregularity strength of fan and wheel graphs [PDF]
AIP Conference Proceedings, 2021 The distance vertex irregular total k-labelings on graph G(V, E) is a mapping f : V (G) ∪ E(G) → {1, 2,…, k} such as for every u, v ∈ V (G) and u ≠ v, the weight of u is not equal to the weight of v. The weight of any vertex u ∈ V (G) evaluate based on the neighborhood of vertices and the neighborhood of edges of u.
D. E. Wijayanti +3 more
openaire +1 more source
On irregularity strength of disjoint union of friendship graphs
Electronic Journal of Graph Theory and Applications, 2013 We investigate the vertex total and edge total modication of the well-known irregularity strength of graphs. We have determined the exact values of the total vertex irregularity strength and the total edge irregularity strength of a disjoint union of ...
Ali Ahmad, Martin Baca, Muhammad Numan
doaj +1 more source