Results 1 to 10 of about 6,181 (108)
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 +2 more sources
Further Results on (a, d) -total Edge Irregularity Strength of Graphs
مجلة بغداد للعلوم, 2023 Consider a simple graph on vertices and edges together with a total labeling . Then ρ is called total edge irregular labeling if there exists a one-to-one correspondence, say defined by for all where Also, the value is said to be the edge weight
MUTHUGURUPACKIAM1 K +3 more
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
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
Note on edge irregular reflexive labelings of graphs
AKCE International Journal of Graphs and Combinatorics, 2019 For a graph , an edge labeling and a vertex labeling are called total -labeling, where . The total -labeling is called an edge irregular reflexive -labeling of the graph , if for every two different edges and of , one has The minimum for which the graph ...
Martin Bača +4 more
doaj +2 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 +1 more source
The reflexive edge strength on some almost regular graphs
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 +1 more source
On total edge irregularity strength of centralized uniform theta graphs
AKCE International Journal of Graphs and Combinatorics, 2018 Let G = ( V , E ) be a simple connected and undirected graph. Let f : V ∪ E → { 1 , 2 , … , k } be a total labeling of G . The weight of an edge u v is defined by w f ( u v ) = f ( u ) + f ( v ) + f ( u v ) .
Riyan Wicaksana Putra, Yeni Susanti
doaj +2 more sources
Total edge irregularity strength of some cycle related graphs
Indonesian Journal of Combinatorics, 2021 An edge irregular total k-labeling f : V ∪ E → 1,2, ..., k of a graph G = (V,E) is a labeling of vertices and edges of G in such a way that for any two different edges uv and u'v', their weights f(u)+f(uv)+f(v) and f(u')+f(u'v')+f(v') are distinct.
Ramalakshmi Rajendran, Kathiresan KM
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