Results 11 to 20 of about 34,731 (238)
On Distance Irregular Labeling of Disconnected Graphs
Kragujevac Journal of Mathematics, 2022 A distance irregular k-labeling of a graph G is a function f : V (G) → {1, 2, . . . , k} such that the weights of all vertices are distinct. The weight of a vertex v, denoted by wt(v), is the sum of labels of all vertices adjacent to v (distance 1 from v), that is, wt(v) = P u∈N(v) f(u).
Susanto, Faisal +3 more
openaire +2 more sources
Local Inclusive Distance Vertex Irregular Graphs
Mathematics, 2021 Let G=(V,E) be a simple graph. A vertex labeling f:V(G)→{1,2,⋯,k} is defined to be a local inclusive (respectively, non-inclusive) d-distance vertex irregular labeling of a graph G if for any two adjacent vertices x,y∈V(G) their weights are distinct ...
Kiki Ariyanti Sugeng +3 more
doaj +1 more source
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
On the edge irregular reflexive labeling of corona product of graphs with path
AKCE International Journal of Graphs and Combinatorics, 2021 We define a total k-labeling of a graph G as a combination of an edge labeling and a vertex labeling such that if and if where The total k-labeling is called an edge irregular reflexive k-labeling of G if every two different edges has distinct edge ...
Kooi-Kuan Yoong +5 more
doaj +1 more source
TOTAL EDGE IRREGULAR LABELING FOR TRIANGULAR GRID GRAPHS AND RELATED GRAPHS
Barekeng, 2023 Let be a graph with and are the set of its vertices and edges, respectively. Total edge irregular -labeling on is a map from to satisfies for any two distinct edges have distinct weights. The minimum for which the satisfies the labeling is spoken
Muhammad Nurul Huda, Yeni Susanti
doaj +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 +3 more
doaj +1 more source
Distance irregularity strength of graphs with pendant vertices [PDF]
Opuscula Mathematica, 2022 A vertex \(k\)-labeling \(\phi:V(G)\rightarrow\{1,2,\dots,k\}\) on a simple graph \(G\) is said to be a distance irregular vertex \(k\)-labeling of \(G\) if the weights of all vertices of \(G\) are pairwise distinct, where the weight of a vertex is the ...
Faisal Susanto +3 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 +2 more
openaire +1 more source
Total irregularity strength for product of two paths
AKCE International Journal of Graphs and Combinatorics, 2020 In this paper we define a totally irregular total labeling for Cartesian and strong product of two paths, which is at the same time vertex irregular total labeling and also edge irregular total labeling.
Muhammad Kamran Siddiqui +2 more
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