Results 1 to 10 of about 181 (130)
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 Edge Irregular Reflexive Labeling for Generalized Prism [PDF]
Journal of Mathematics, 2022 Among the various ideas that appear while studying graph theory, which has gained much attraction especially in graph labeling, labeling of graphs gives mathematical models which value for a vast range of applications in high technology (data security ...
Chenxi Wang +5 more
doaj +2 more sources
Note on edge irregular reflexive labelings of graphs [PDF]
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 +3 more sources
On the edge irregular reflexive labeling of corona product of graphs with path [PDF]
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 +3 more sources
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 +2 more sources
Edge Irregular Reflexive Labeling for Disjoint Union of Generalized Petersen Graph [PDF]
Mathematics, 2018 A graph labeling is the task of integers, generally spoken to by whole numbers, to the edges or vertices, or both of a graph. Formally, given a graph G = ( V , E ) a vertex labeling is a capacity from V to an arrangement of integers. A graph with
Juan L. G. Guirao +3 more
doaj +2 more sources
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 +2 more sources
Edge irregular reflexive labeling on sun graph and corona of cycle and null graph with two vertices
Indonesian Journal of Combinatorics, 2021 Let G(V,E) be a simple and connected graph which set of vertices is V and set of edges is E. Irregular reflexive k-labeling f on G(V,E) is assignment that carries the numbers of integer to elements of graph, such that the positive integer {1,2, 3,...,ke}
Irfan Setiawan, Diari Indriati
doaj +3 more sources
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 +2 more sources
Edge Irregular Reflexive Labeling for the Disjoint Union of Gear Graphs and Prism Graphs [PDF]
Mathematics, 2018 In graph theory, a graph is given names—generally a whole number—to edges, vertices, or both in a chart. Formally, given a graph G = ( V , E ) , a vertex naming is a capacity from V to an arrangement of marks.
Xiujun Zhang +3 more
doaj +3 more sources