Results 1 to 10 of about 15,436 (257)
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
On Edge H-Irregularity Strength of Hexagonal and Octagonal Grid Graphs [PDF]
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 +5 more sources
Computing The Irregularity Strength of Planar Graphs [PDF]
Mathematics, 2018 The field of graph theory plays a vital role in various fields. One of the important areas in graph theory is graph labeling used in many applications such as coding theory, X-ray crystallography, radar, astronomy, circuit design, communication network ...
Hong Yang +4 more
doaj +3 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
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 +3 more sources
On H-Irregularity Strength Of Graphs
Discussiones Mathematicae Graph Theory, 2017 New graph characteristic, the total H-irregularity strength of a graph, is introduced. Estimations on this parameter are obtained and for some families of graphs the precise values of this parameter are proved.
Ashraf Faraha +3 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
A note on edge irregularity strength of firefly graph [PDF]
Notes on Number Theory and Discrete Mathematics, 2023 Let G be a simple graph. A vertex labeling ψ:V(G) → {1, 2,...,α} is called α-labeling. For an edge uv — G, the weight of uv, written z_{ψ}(uv), is the sum of the labels of u and v, i.e., z_{ψ}(uv)=ψ(u)+ψ(v).
Umme Salma, H. M. Nagesh, D. Prahlad
doaj +1 more source
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