Results 11 to 20 of about 2,584 (237)
On irregularity strength of diamond network
AKCE International Journal of Graphs and Combinatorics, 2018 In this paper we investigate the total edge irregularity strength tes ( G ) and the total vertex irregularity strength tvs ( G ) of diamond graphs B r n and prove that tes ( B r n ) = ( 5 n − 3 ) ∕ 3 , while tvs ( B r n ) = ( n + 1 ) ∕ 3 .
Nurdin Hinding +4 more
doaj +2 more sources
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
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 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
Total absolute difference edge irregularity strength of Tp-tree graphs
Proyecciones (Antofagasta), 2023 A total labeling ξ is defined to be an edge irregular total absolute difference k-labeling of the graph G if for every two different edges e and f of G there is wt(e) 6= wt(f) where weight of an edge e = xy is defined as wt(e) = |ξ(e) − ξ(x) − ξ(y)|. The minimum k for which the graph G has an edge irregular total absolute difference labeling is called ...
Lourdusamy, A. +2 more
openaire +2 more sources
On the edge irregularity strength of corona product of cycle with isolated vertices
AKCE International Journal of Graphs and Combinatorics, 2016 In this paper, we investigate the new graph characteristic, the edge irregularity strength, denoted as es, as a modification of the well known irregularity strength, total edge irregularity strength and total vertex irregularity strength. As a result, we
I. Tarawneh, R. Hasni, A. Ahmad
doaj +1 more source
Computing The Irregularity Strength of Planar Graphs
Mathematics, 2018 The field of graph theory plays a vital role in various fields. One of the important areas in graph theory is graph labeling used in many applications such as coding theory, X-ray crystallography, radar, astronomy, circuit design, communication network ...
Hong Yang +4 more
doaj +1 more source
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
On Total Vertex Irregularity Strength of Hexagonal Cluster Graphs
International Journal of Mathematics and Mathematical Sciences, 2021 For a simple graph G with a vertex set VG and an edge set EG, a labeling f:VG∪EG⟶1,2,⋯,k is called a vertex irregular total k−labeling of G if for any two different vertices x and y in VG we have wtx≠wty where wtx=fx+∑u∈VGfxu.
Nurdin Hinding +3 more
doaj +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