Results 1 to 10 of about 1,436 (179)

Modular Irregular Labeling on Double-Star and Friendship Graphs [PDF]

Journal of Mathematics, 2021
A modular irregular graph is a graph that admits a modular irregular labeling. A modular irregular labeling of a graph G of order n is a mapping of the set of edges of the graph to 1,2,…,k such that the weights of all vertices are different.
K. A. Sugeng, Z. Z. Barack, N. Hinding, R. Simanjuntak   +3 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   +1 more source

ON THE IRREGULARITY STRENGTH AND MODULAR IRREGULARITY STRENGTH OF FRIENDSHIP GRAPHS AND ITS DISJOINT UNION

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, Mozart W. Talakua, Yopi Andry Lesnussa   +2 more
doaj   +1 more source

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, Muhammad Imran, Andrea Semaničová-Feňovčíková   +2 more
doaj   +1 more source

Modular Irregular Labeling on Firecrackers Graphs

Proximal: Jurnal Penelitian Matematika dan Pendidikan Matematika, 2022
Let G= (V, E) be a graph order n and an edge labeling ψ: E→{1,2,…,k}. Edge k labeling ψ is to be modular irregular -k labeling if exist a bijective map σ: V→Zn with σ(x)= ∑yϵv ψ(xy)(mod n). The modular irregularity strength of G (ms(G))is a minimum positive integer k such that G have a modular irregular labeling. If the modular irregularity strength is
Dermawan Lase, Nurdin Hinding, Amir Kamal Amir   +2 more
openaire   +1 more source

Modular Irregular Labeling On Complete Graphs

Daya Matematis: Jurnal Inovasi Pendidikan Matematika, 2022
Let G be a simple graph of n order. An edge labeling such that the weights of all vertex are different and elements of the set modulo n, are called a modular irregular labeling. The modular irregularity strength of G is a minimum positive integer k such that G have a modular irregular labeling.
Indah Chairun Nisa, Nurdin Nurdin, Hasmawati Basir   +2 more
openaire   +1 more source

Modular irregularity strength of graphs

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, Kadarkarai Muthugurupackiam, KM. Kathiresan, S. Ramya   +3 more
doaj   +1 more source

Modular irregularity strength of disjoint union of cycle-related graph [PDF]

ITM Web of Conferences
Let 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, Sugeng Kiki Ariyanti   +1 more
doaj   +1 more source

Modular irregularity strength of the corona product of graphs [PDF]

Discrete Mathematics Letters
Zeveliano Zidane Barack, Kiki Ariyanti Sugeng, Andrea Semaničová-Feňovčíková, Martin Bača   +3 more
doaj   +1 more source

Optimizing hybrid network topologies in communication networks through irregularity strength. [PDF]

Sci Rep
Naqvi SAA, Ashraf F, Ovais A, Rasheed MW, Asif A, Alameri A.   +5 more
europepmc   +1 more source