Results 1 to 10 of about 1,250 (75)
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 +4 more sources
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 +2 more sources
BarekengAssume that be an undirected simple graph with vertex set and edge set . The edge irregular reflexive -labeling of graph is a labeling selects positive integers from 1 to as edge labels and non negative even numbers from 0 to as vertex ...
Diari Indriati +2 more
doaj +2 more sources
On reflexive edge strength of generalized prism graphs
Electronic Journal of Graph Theory and Applications, 2022 Summary: Let \(G\) be a connected, simple and undirected graph. The assignments \(\{0, 2, \dots, 2k_{v}\}\) to the vertices and \(\{1, 2, \dots, k_{e}\}\) to the edges of graph \(G\) are called total \(k\)-labelings, where \(k = \max\{k_e, 2k_{v}\}\). The total \(k\)-labeling is called an reflexive edge irregular \(k\)-labeling of the graph \(G\), if ...
Irfan, Muhammad +2 more
openaire +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
Reflexive edge strength of convex polytopes and corona product of cycle with path
AIMS Mathematics, 2022 <abstract><p>For a graph $ G $, we define a total $ k $-labeling $ \varphi $ is a combination of an edge labeling $ \varphi_e(x)\to\{1, 2, \ldots, k_e\} $ and a vertex labeling $ \varphi_v(x) \to \{0, 2, \ldots, 2k_v\} $, such that $ \varphi(x) = \varphi_v(x) $ if $ x\in V(G) $ and $ \varphi(x) = \varphi_e(x) $ if $ x\in E(G) $, then $ k = \
Kooi-Kuan Yoong +4 more
openaire +2 more sources
Note on edge irregular reflexive labelings of graphs
AKCE International Journal of Graphs and Combinatorics, 2019 For a graph G, an edge labeling fe:E(G)→{1,2,…,ke}and a vertex labeling fv:V(G)→{0,2,4,…,2kv}are called total k-labeling, where k=max{ke,2kv}. The total k-labeling is called an edge irregular reflexive k-labeling of the graph G, if for every two ...
Martin Bača +4 more
doaj +2 more sources
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
Barekeng, 2023 Let G in this paper be a connected and simple graph with set V(G) which is called a vertex and E(G) which is called an edge. The edge irregular reflexive k-labeling f on G consist of integers {1,2,3,...,k_e} as edge labels and even integers {0,2,4 ...
Lutfiah Alifia Zalzabila +2 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