Results 11 to 20 of about 1,270 (95)
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 +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
Frontiers in Human Neuroscience, 2023 IntroductionThe mechanisms regulating neuromuscular control of standing balance can be influenced by visual sensory feedback and arousal. Virtual reality (VR) is a cutting-edge tool for probing the neural control of balance and its dependence on visual ...
Daniel D. Hodgson +9 more
doaj +1 more source
On Edge Irregular Reflexive Labeling for Generalized Prism
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 +1 more source
On the reflexive edge strength of the circulant graphs
AIMS Mathematics, 2021 A labeling of a graph is an assignment that carries some sets of graph elements into numbers (usually the non negative integers). The total $ k $-labeling is an assignment $ f_{e} $ from the edge set to the set $ \{1, 2, ..., k_{e} \} $ and assignment $ f_{v} $ from the vertex set to the set $ \{0, 2, 4, ..., 2k_{v} \} $, where $ k = max\{k_{e}, 2k_{v}
openaire +3 more sources
On Edge Irregular Reflexive Labellings for the Generalized Friendship Graphs
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 ...
Martin Bača +4 more
doaj +1 more source
Edge Irregular Reflexive Labeling for Disjoint Union of Generalized Petersen Graph
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 +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
Edge Irregular Reflexive Labeling for the Disjoint Union of Gear Graphs and Prism Graphs
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 +1 more source
EDGE IRREGULAR REFLEXIVE LABELING OF DUMBBELL GRAPH, CORONA OF OPEN LADDER, AND NULL GRAPH
BarekengGraph 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 +2 more
doaj +1 more source