Results 1 to 10 of about 3,517 (256)
On the edge irregularity strength of grid graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 For a simple graph G, a vertex labeling is called a vertex -labeling. For any edge in , its weight . If all the edge weights are distinct, then is called an edge irregular -labeling of .
I. Tarawneh, R. Hasni, A. Ahmad
doaj +2 more sources
A note on edge irregularity strength of firefly graph [PDF]
Notes on Number Theory and Discrete Mathematics, 2023 Let G be a simple graph. A vertex labeling ψ:V(G) → {1, 2,...,α} is called α-labeling. For an edge uv — G, the weight of uv, written z_{ψ}(uv), is the sum of the labels of u and v, i.e., z_{ψ}(uv)=ψ(u)+ψ(v).
Umme Salma, H. M. Nagesh, D. Prahlad
doaj +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 +4 more sources
Total edge irregularity strength of some cycle related graphs
Indonesian Journal of Combinatorics, 2021 An edge irregular total k-labeling f : V ∪ E → 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 two different edges uv and u'v', their weights f(u)+f(uv)+f(v) and f(u')+f(u'v')+f(v') are distinct.
Ramalakshmi Rajendran, Kathiresan KM
doaj +3 more sources
On Total H-Irregularity Strength of the Disjoint Union of Graphs
Discussiones Mathematicae Graph Theory, 2020 A simple graph G admits an H-covering if every edge in E(G) belongs to at least to one subgraph of G isomorphic to a given graph H. For the subgraph H ⊆ G under a total k-labeling we define the associated H-weight as the sum of labels of all vertices and
Ashraf Faraha +5 more
doaj +4 more sources
Optimizing hybrid network topologies in communication networks through irregularity strength [PDF]
Scientific ReportsGraph theory has emerged as an influential tool for communication network design and analysis, especially for designing hybrid network topologies for local area networks (LANs).
Syed Aqib Abbas Naqvi +5 more
doaj +2 more sources
On total edge irregularity strength of polar grid graph [PDF]
Journal of Taibah University for Science, 2019 For a graph $G $, an edge irregular total $r $-labelling $\pi :V \cup E \to \{{1,2,3, \ldots ,r} \} $ is a labelling for edges and vertices of a graph $G $ in such a way that the weights of any two different edges are distinct. The minimum for which $G $
F. Salama
doaj +2 more sources
Further results on edge irregularity strength of graphs
Indonesian Journal of Combinatorics, 2017 A vertex $k$-labelling $\phi:V(G)\longrightarrow \{1,2,\ldots,k\}$ is called irregular $k$-labeling of the graph $G$ if for every two different edges $e$ and $f$, there is $w_{\phi}(e)\neq w_{\phi}(f)$; where the weight of an edge is given by $e=xy\in E ...
Muhammad Imran +3 more
doaj +3 more sources
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 +2 more sources
Total edge irregularity strength of quadruplet and quintuplet book graphs [PDF]
ITM Web of Conferences, 2021 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-labelling is a function f : V ᴗE → {1,2,…,k} such that for any two different edges xy and x’y’ in E, their weights are distinct.
Ratnasari Lucia +3 more
doaj +1 more source