The reflexive edge strength on some almost regular graphs
Ika Hesti Agustin1,2, Dafik3, M Imam Utoyo2
1CGANT-University of Jember, Indonesia.
Abstract:
A function f with domain and range are respectively the edge set of graph G and natural number up to , and a function f with domain and range are respectively the vertex set of graph G and the even natural number up to are called a total k-labeling where . The total k-labeling of graph G by the condition that every two different edges have different weight is called an edge irregular reflexive k-labeling, where for any edge , the weight is . The reflexive edge strength of the graph G, denoted by is the minimum k for graph G which has an edge irregular reflexive k-labelling. In this study, we obtained the of graphs which their vertex degrees show an almost regularity properties.
Related Concept Videos
Graphical Representation of Inequalities
Graphs of Functions
Graphs of Polar Equations
Vector Algebra: Graphical Method
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
Graphs of Equations in Two Variables
Routh-Hurwitz Criterion II
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...


