Results 31 to 40 of about 15,436 (257)
Total irregularity strength for product of two paths
AKCE International Journal of Graphs and Combinatorics, 2020 In this paper we define a totally irregular total labeling for Cartesian and strong product of two paths, which is at the same time vertex irregular total labeling and also edge irregular total labeling.
Muhammad Kamran Siddiqui +2 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
Modular edge irregularity strength of graphs
AIMS Mathematics, 2023 <abstract><p>For a simple graph $ G = (V, E) $ with the vertex set $ V(G) $ and the edge set $ E(G) $, a vertex labeling $ \varphi: V(G) \to \{1, 2, \dots, k\} $ is called a $ k $-labeling. The weight of an edge under the vertex labeling $ \varphi $ is the sum of the labels of its end vertices and the modular edge-weight is the remainder of
Ali N. A. Koam +3 more
openaire +2 more sources
TOTAL EDGE IRREGULARITY STRENGTH DARI GRAF K_n-{e}
E-Jurnal Matematika, 2018 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
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
On total edge irregularity strength of centralized uniform theta graphs
AKCE International Journal of Graphs and Combinatorics, 2018 Let G = ( V , E ) be a simple connected and undirected graph. Let f : V ∪ E → { 1 , 2 , … , k } be a total labeling of G . The weight of an edge u v is defined by w f ( u v ) = f ( u ) + f ( v ) + f ( u v ) .
Riyan Wicaksana Putra, Yeni Susanti
doaj +2 more sources
Irregularity strength of dense graphs
Discrete Mathematics, 1991 Let \(G\) be a simple graph. Then positive integer weights can be assigned to the edges of \(G\) so that the weighted degrees of all vertices are distinct. An assignment of weights to the edges of \(G\) such that the weighted degrees of all vertices are distinct is called an irregular assignment of \(G\).
Faudree, R.J. +3 more
openaire +1 more source
TOTAL EDGE AND VERTEX IRREGULAR STRENGTH OF TWITTER NETWORK
Barekeng, 2022 Twitter data can be converted into a graph where users can represent the vertices. Then the edges can be represented as relationships between users. This research focused on determining the total edge irregularity strength (tes) and the total vertices ...
Edy Saputra Rusdi, Nur Hilal A. Syahrir
doaj +1 more source
A Survey of Irregularity Strength
Electronic Notes in Discrete Mathematics, 2015 Abstract This survey aims to give an overview of the modifications of the well-known irregular assignments, namely edge irregular labelings, vertex irregular and edge irregular total labelings, and face irregular entire labelings of graphs.
Martin Bača +4 more
openaire +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