Results 11 to 20 of about 3,517 (256)
Modular edge irregularity strength of graphs
AIMS Mathematics, 2023 <abstract><p>For a simple graph $ G = (V, E) $ with the vertex set $ V(G) $ and the edge set $ E(G) $, a vertex labeling $ \varphi: V(G) \to \{1, 2, \dots, k\} $ is called a $ k $-labeling. The weight of an edge under the vertex labeling $ \varphi $ is the sum of the labels of its end vertices and the modular edge-weight is the remainder of
Ali N. A. Koam +3 more
openaire +2 more sources
Total Absolute Difference Edge Irregularity Strength of Graphs
Kragujevac Journal of Mathematics, 2022 We introduce a new graph characteristic, the total absolute difference edge irregularity strength. We obtain the estimation on the total absolute difference edge irregularity strength and determine the precise values for some families of graphs.
Ramalakshmi, R., Kathiresan, Km.
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
On Edge H-Irregularity Strength of Hexagonal and Octagonal Grid Graphs
Journal of Mathematics, 2022 The edge H-irregularity strength, ehsΓ,H, of a graph Γ is the smallest integer k, such that Γ has an H-irregular edge k-labeling. In this study, we compute the exact value of edge H-irregularity strength of hexagonal and octagonal grid graphs.
Muhammad Ibrahim +3 more
doaj +1 more source
مجلة بغداد للعلوم, 2023 Let G be a graph with p vertices and q edges and be an injective function, where k is a positive integer. If the induced edge labeling defined by for each is a bijection, then the labeling f is called an odd Fibonacci edge irregular labeling of G.
M. Uma Devi, M. Kamaraj, S. Arockiaraj
doaj +1 more source
On The Edge Irregularity Strength of Firecracker Graphs F2,m
Kubik, 2022 Let be a graph and k be a positive integer. A vertex k-labeling is called an edge irregular labeling if there are no two edges with the same weight, where the weight of an edge uv is .
Rismawati Ramdani, Desi Laswati Suwandi
doaj +1 more source
On total edge irregularity strength of centralized uniform theta graphs
AKCE International Journal of Graphs and Combinatorics, 2018 Let G = ( V , E ) be a simple connected and undirected graph. Let f : V ∪ E → { 1 , 2 , … , k } be a total labeling of G . The weight of an edge u v is defined by w f ( u v ) = f ( u ) + f ( v ) + f ( u v ) .
Riyan Wicaksana Putra, Yeni Susanti
doaj +2 more sources
Irregularity and Modular Irregularity Strength of Wheels
Mathematics, 2021 It is easily observed that the vertices of a simple graph cannot have pairwise distinct degrees. This means that no simple graph of the order of at least two is, in this way, irregular. However, a multigraph can be irregular.
Martin Bača +2 more
doaj +1 more source
On the edge irregularity strength of corona product of cycle with isolated vertices
AKCE International Journal of Graphs and Combinatorics, 2016 In this paper, we investigate the new graph characteristic, the edge irregularity strength, denoted as es, as a modification of the well known irregularity strength, total edge irregularity strength and total vertex irregularity strength. As a result, we
I. Tarawneh, R. Hasni, A. Ahmad
doaj +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