Results 1 to 10 of about 619 (170)
The reflexive edge strength on some almost regular graphs [PDF]
Heliyon, 2021 A function f with domain and range are respectively the edge set of graph G and natural number up to ke, and a function f with domain and range are respectively the vertex set of graph G and the even natural number up to 2kv are called a total k-labeling
Ika Hesti Agustin +4 more
doaj +2 more sources
On Distance Vertex Irregular Total k-Labeling
Science and Technology Indonesia, 2023 Let H= (T,S), be a finite simple graph, T(H)= T and S(H)= S, respectively, are the sets of vertices and edges on H. Let σ:T∪S→1,2,· · · ,k, be a total k-labeling on H and wσ(x), be a weight of x∈T while using σ labeling, which is evaluated based on the total number of all vertices labels in the neighborhood x and its incident edges.
Dian Eka Wijayanti +4 more
openaire +1 more source
On Total Vertex Irregularity Strength of Hexagonal Cluster Graphs
International Journal of Mathematics and Mathematical Sciences, 2021 For a simple graph G with a vertex set VG and an edge set EG, a labeling f:VG∪EG⟶1,2,⋯,k is called a vertex irregular total k−labeling of G if for any two different vertices x and y in VG we have wtx≠wty where wtx=fx+∑u∈VGfxu.
Nurdin Hinding +3 more
doaj +1 more source
The reflexive edge strength of toroidal fullerene
AKCE International Journal of Graphs and Combinatorics, 2023 A toroidal fullerene (toroidal polyhex) is a cubic bipartite graph embedded on the torus such that each face is a hexagon. The total k-labeling is defined as a combination of an edge function χe from the edge set to the set [Formula: see text] and a ...
M. Basher
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
The Distance Irregular Reflexive k-Labeling of Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 A total k-labeling is a function fe from the edge set to the set {1, 2, . . . , ke} and a function fv from the vertex set to the set {0, 2, 4, . . . , 2kv}, where k = max{ke, 2kv}.
Ika Hesti Agustin +4 more
doaj +1 more source
An Edge Irregular Reflexive k−labeling of Comb Graphs with Additional 2 Pendants
Jurnal Matematika Integratif, 2023 Let G be a connected, simple, and undirrected graph, where V (G) is the vertex set and E(G) is the edge set. Let k be a natural numbers. For graph G we define a total k−labeling ρ such that the vertices of graph G are labeled with {0, 2, 4, . . .
Sri Nurhayati, Yeni Susanti
doaj +1 more source
On the Construction of the Reflexive Vertex k-Labeling of Any Graph with Pendant Vertex
International Journal of Mathematics and Mathematical Sciences, 2020 A total k-labeling is a function fe from the edge set to first natural number ke and a function fv from the vertex set to non negative even number up to 2kv, where k=maxke,2kv.
I. H. Agustin +4 more
doaj +1 more source
Barekeng, 2023 Let G be an undirected, connected, and simple graph with edges set E(G)and vertex set V(G). An edge irregular reflexive k-labeling f is one in which the label for each edge is an integer number {1,2,…, k_e} and the label for each vertex is an even ...
Diari Indriati, Tsabita Azzahra
doaj +1 more source
Irregular labelings of helm and sun graphs
AKCE International Journal of Graphs and Combinatorics, 2015 A vertex irregular total k-labeling of a (p,q)-graph G=(V,E) is a labeling ϕ:V∪E→{1,2,…,k} such that the weights of the vertices wt(v)=ϕ(v)+∑uv∈Eϕ(uv) are different for all vertices.
Ali Ahmad +2 more
doaj +1 more source