Results 11 to 20 of about 6,181 (108)
The Distance Irregular Reflexive k-Labeling of Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 A total k-labeling is a function fe from the edge set to the set {1, 2, . . . , ke} and a function fv from the vertex set to the set {0, 2, 4, . . . , 2kv}, where k = max{ke, 2kv}.
Ika Hesti Agustin +4 more
doaj +1 more source
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
On Edge Irregular Total k-labeling and Total Edge Irregularity Strength of Barbell Graphs
Journal of Physics: Conference Series, 2019 Abstract Let G be a connected graph with a non empty vertex set V(G) and edge set E(G). An edge irregular total k-labeling of a graph G is a labeling λ : V(G) ⋃ E(G) → {1, 2, …, k}, so that every two different edges have different weights.
Melli Aftiana, Diari Indriati
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
Total Edge Fibonacci-Like Sequence Irregular Labeling
International Journal of Mathematics and Soft Computing, 2014 In this paper, we are introducing total edge Fibonacci-like sequence irregular labeling. A total edge Fibonacci-like sequence irregular labeling f : V (G) S E(G) → {1, 2, . . . ,K} of a graph G = (V,E) is a labeling of vertices and edges of G in such a way that for any different edges xy and x 0 y 0 their weights f( x ) + f( xy ) + f( y ) and f( x 0 )
S. Navanaeethakrishnan +2 more
openaire +1 more source
Indian Journal of Science and Technology, 2016 - Many networks have been found the total edge irregularity strength???s. In this paper, we found that the total edge irregularity strength of network constructed by some copies of cycle on three vertices corona a vertex is for where is the number copies of cycle on three vertices.
null Nurdin +2 more
openaire +4 more sources
Irregular labelings of helm and sun graphs
AKCE International Journal of Graphs and Combinatorics, 2015 A vertex irregular total k-labeling of a (p,q)-graph G=(V,E) is a labeling ϕ:V∪E→{1,2,…,k} such that the weights of the vertices wt(v)=ϕ(v)+∑uv∈Eϕ(uv) are different for all vertices.
Ali Ahmad +2 more
doaj +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 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
Total Edge Lucas Irregular Labeling
International Journal of Mathematics and Soft Computing, 2015 For a graph ( ) total edge Lucas irregular labeling f :V(G) ?E (G) ? {1,2,…,K} is defined as a labeling on V(G) and E (G) in such a way that for any two different edges and , their weights ( ) ( ) ( ) and ( ) ( ) ( ) are distinct Lucas numbers.The total edge Lucas irregularity strength, tels(G), is defined as the minimum K for which G has total edge ...
A. Nagarajan +2 more
openaire +1 more source