Results 1 to 10 of about 601 (189)
Irregularity and Modular Irregularity Strength of Wheels [PDF]
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 +2 more sources
Modular irregularity strength of graphs [PDF]
Electronic Journal of Graph Theory and Applications, 2020 We introduce a modular irregularity strength of graphs as modification of the well-known irregularity strength. We obtain some estimation on modular irregularity strength and determine the exact values of this parameter for five families of graphs.
Martin Baca +3 more
doaj +3 more sources
Two types irregular labelling on dodecahedral modified generalization graph [PDF]
Heliyon, 2022 Irregular labelling on graph is a function from component of graph to non-negative natural number such that the weight of all vertices, or edges are distinct. The component of graph is a set of vertices, a set of edges, or a set of both. In this paper we
Nurdin Hinding +4 more
doaj +2 more sources
The Modular Irregularity Strength of C_n⊙mK_1
InPrime, 2022 Let G(V, E) be a graph with order n with no component of order 2. An edge k-labeling α: E(G) →{1,2,…,k} is called a modular irregular k-labeling of graph G if the corresponding modular weight function wt_ α:V(G) → Z_n defined by wt_ α(x) =Ʃ_(xyϵE(G)) α ...
Putu Kartika Dewi
doaj +2 more sources
Barekeng, 2022 For a simple, undirected graph G with, at most one isolated vertex and no isolated edges, a labeling f:E(G)→{1,2,…,k1} of positive integers to the edges of G is called irregular if the weights of each vertex of G has a different value.
Fredrylo Alberth Noel Joddy Apituley +2 more
doaj +2 more sources
Modular H-Irregularity Strength of Graphs
MathematicsTwo new graph characteristics, the modular edge H-irregularity strength and the modular vertex H-irregularity strength, are introduced. Lower bounds on these graph characteristics are estimated, and their exact values are determined for certain families ...
Martin Bača +2 more
doaj +2 more sources
Modular irregularity strength of disjoint union of cycle-related graph [PDF]
ITM Web of ConferencesLet G = (V,E) be a graph with a vertex set V and an edge set E of G, with order n. Modular irregular labeling of a graph G is an edge k-labeling φ:E → {1, 2,…,k} such that the modular weight of all vertices is all different. The modular weight is defined
Barack Zeveliano Zidane +1 more
doaj +2 more sources
Modular irregularity strength of the corona product of graphs [PDF]
Discrete Mathematics LettersZeveliano Zidane Barack +3 more
doaj +3 more sources
The Irregularity and Modular Irregularity Strength of Fan Graphs [PDF]
Symmetry, 2021 For a simple graph G with no isolated edges and at most, one isolated vertex, a labeling φ:E(G)→{1,2,…,k} of positive integers to the edges of G is called irregular if the weights of the vertices, defined as wtφ(v)=∑u∈N(v)φ(uv), are all different. The irregularity strength of a graph G is known as the maximal integer k, minimized over all irregular ...
Martin Bača +3 more
openaire +1 more source
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