Results 21 to 30 of about 3,517 (256)
TOTAL EDGE IRREGULARITY STRENGTH DARI GRAF K_n-{e}
E-Jurnal Matematika, 2019 In this paper we determine the total edge irregularity strength of , that is a complete graph in which one of its edge has been removed. To do so, we make three cases.
MUARDI - ,, QURRATUL AINI, , IRWANSYAH
doaj +1 more source
Barekeng, 2022 For a simple, undirected graph G with, at most one isolated vertex and no isolated edges, a labeling f:E(G)→{1,2,…,k1} of positive integers to the edges of G is called irregular if the weights of each vertex of G has a different value.
Fredrylo Alberth Noel Joddy Apituley +2 more
doaj +1 more source
Total edge irregularity strength of triple book graphs
Journal of Physics: Conference Series, 2021 Abstract Let G(V, E) be a finite, simple and undirected graph with a vertex set V and an edge set E. An edge irregular total k-labeling is a map f : V ⋃ E → {1, 2, …, k} such that for any two different edges xy and x′y′ in E, ω(xy) ≠ ω(x′y′) where ω(xy) = f(x) + f(y) + f(xy).
L Ratnasari +3 more
openaire +1 more source
Modular Irregular Labeling on Double-Star and Friendship Graphs
Journal of Mathematics, 2021 A modular irregular graph is a graph that admits a modular irregular labeling. A modular irregular labeling of a graph G of order n is a mapping of the set of edges of the graph to 1,2,…,k such that the weights of all vertices are different.
K. A. Sugeng +3 more
doaj +1 more source
TOTAL EDGE IRREGULARITY STRENGTH OF SERIES PARALLEL GRAPHS [PDF]
International Journal of Pure and Apllied Mathematics, 2015 Dado un gráfico G(V, E), se denomina etiquetado → k total irregular de borde si para cada par de bordes distintos uv y xy, el mínimo k para el cual G tiene un etiquetado k total irregular de borde se denomina fuerza de irregularidad de borde total. En este artículo consideramos la composición en serie de gráficos theta uniformes y obtenemos su fuerza ...
Indra Rajasingh, S. Teresa Arockiamary
openaire +1 more source
Total edge irregularity strength of trees
Discussiones Mathematicae Graph Theory, 2006 A total edge-irregular k-labelling ξ : V (G) ∪ E(G) → {1, 2, . . . , k} of a graph G is a labelling of vertices and edges of G in such a way that for any different edges e and f their weights wt(e) and wt(f) are distinct. The weight wt(e) of an edge e = xy is the sum of the labels of vertices x and y and the label of the edge e. The minimum k for which
Jaroslav Ivančo, Stanislav Jendrol'
openaire +1 more source
On -irregularity strength of ladders and fan graphs
AKCE International Journal of Graphs and Combinatorics, 2020 We investigate modifications of the well-known irregularity strength of graphs, namely, total (vertex, edge) -irregularity strengths. Recently the bounds and precise values for some families of graphs concerning these parameters have been determined.
Faraha Ashraf +3 more
doaj +1 more source
Total Edge Irregularity Strength of Butterfly Networks
International Journal of Computer Applications, 2012 Given a graph G (V, E) a labeling : VE{1, 2... k} is called an edge irregular total k-labeling if for every pair of distinct edges uv and xy, (u) + (uv) + (v) (x) + (xy) + (y). The minimum k for which G has an edge irregular total k-labeling is called the total edge irregularity strength of G.
S. Teresa Arockiamary +2 more
openaire +1 more source
On Valuation of Edge Irregularity Strength of Certain Graphical Families
Journal of Mathematics, 2022 This article comprises of exact valuation of a graph parameter, known as the edge irregularity strength EIS, symbolized as eisG, of various graphical families such as middle graph of path graph, middle graph of cycle graph, snake graph (string 2 ...
Zhiqiang Zhang +4 more
doaj +1 more source
Total Edge Irregularity Strength of Star Snake Graphs
European Journal of Pure and Applied Mathematics, 2023 In different fields in our life, like physics, coding theory and computer science, graph labeling dramas an vital role and appears in many applications. A labeling of a graph is a map which assign each element in with a positive integer number. An edge irregular total -labeling is a function such that where and are weights for any two distinct
Hala Attiya, Nasr Ahmed, Fatma Salama
openaire +1 more source