Results 11 to 20 of about 181 (130)

EDGE IRREGULAR REFLEXIVE LABELING OF DUMBBELL GRAPH, CORONA OF OPEN LADDER, AND NULL GRAPH

Barekeng
Graph  is a simple, connected, undirected graph with vertex set  and edge set . A graph  is called to have an edge irregular reflexive -labeling if its vertices can be labeled with even numbers from  until  and its edges can be labeled with ...
Thetania Miftakul Zalsa, Diari Indriati, Titin Sri Martini   +2 more
doaj   +2 more sources

Edge irregular reflexive labeling on tadpole graphs Tm,1 and Tm,2 [PDF]

AIP Conference Proceedings, 2021
Let G be a connected graph with vertex set V(G) and egde set E(G). An edge irregular reflexive k-labeling is a function fe : E(G) → {1,2,…,ke} and a function fv : V(G) → {0,2,…, 2kv}, where k = max {ke, 2kv} of a graph G such that the weights for all edge are distinct.
Nadia Indarwati Setia Budi, Diari Indriati, Bowo Winarno   +2 more
openaire   +1 more source

Edge irregular reflexive labeling on umbrella graphs U3,n and U4,n [PDF]

AIP Conference Proceedings, 2021
Let G be an undirected and connected graph with vertex set V(G) and edge set E(G). An edge irregular reflexive k-labeling is a function fe : E(G) → {1, 2,…, ke} and a function fv : V(G) → {0,2,…,2kv}, where k = max {ke, 2kv} of a graph G such that the weights for all edge is distinct. Under f labeling for edges and vertices, the weight of edge xy in G,
Nabilla Ayu Rahmawati, Diari Indriati
openaire   +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

Edge irregular reflexive labeling on banana tree graphs B2,n and B3,n [PDF]

AIP Conference Proceedings, 2021
Let G be an undirected and simple graph with vertices set V(G) and edges set E(G). An edge irregular reflexive k-labeling f such that element edges labeled with integers number {1,2,…,ke} and vertices labeled with even integers {0,2,…,2kv}, k = max{ke, 2kv} of a graph G such that the weights for all edges are distinct.
Jihan Almaas Novelia, Diari Indriati
openaire   +1 more source

On Edge Irregular Reflexive Labellings for the Generalized Friendship Graphs [PDF]

Mathematics, 2017
We study an edge irregular reflexive k-labelling for the generalized friendship graphs, also known as flowers (a symmetric collection of cycles meeting at a common vertex), and determine the exact value of the reflexive edge strength for several subfamilies of the generalized friendship graphs.
Martin Bača, Muhammad Irfan, Joe Ryan, Andrea Semaničová-Feňovčíková, Dushyant Tanna   +4 more
openaire   +3 more sources

Edge irregular reflexive labeling of some tree graphs

Journal of Physics: Conference Series, 2020
Abstract Let G be a connected, simple, and undirected graph with a vertex set V(G) and an edge set E(G). Total k-labeling is a function fe from the edge set to the first ke natural number, and a function fv from the vertex set to the non negative even number up to 2kv, where k ...
Ika Hesti Agustin, Imam Utoyo, null Dafik, M. Venkatachalam   +3 more
openaire   +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, Dafik Dafik, N. Mohanapriya, Marsidi Marsidi, Ismail Naci Cangul   +4 more
doaj   +1 more source

Edge Irregular Reflexive Labeling on Corona of Path and Other Graphs

Journal of Physics: Conference Series, 2020
Abstract Let G(V, E) be an undirected and simple graph with vertex set V and edge set E Define a k -labeling f on G such that the element belong to E are labeled with integers {1,2,…,ke } and the element belong to V are labeled with even integers {0,2,…,2kv }, where k = max{ke ,2kv
Diari Indriati, null Widodo, Isnaini Rosyida   +2 more
openaire   +1 more source

Edge irregular reflexive labeling for the $ r $-th power of the path

AIMS Mathematics, 2021
<abstract><p>Let $ G(V, E) $ be a graph, where $ V(G) $ is the vertex set and $ E(G) $ is the edge set. Let $ k $ be a natural number, a total k-labeling $ \varphi:V(G)\bigcup E(G)\rightarrow \{0, 1, 2, 3, ..., k\} $ is called an edge irregular reflexive $ k $-labeling if the vertices of $ G $ are labeled with the set of even numbers from $
openaire   +2 more sources