Results 1 to 10 of about 2,584 (237)
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
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 +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
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 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
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 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 +3 more sources
Computing the total H-irregularity strength of edge comb product of graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2023 A simple undirected graph = (V Γ, EΓ) admits an H-covering if every edge in E belongs to at least one subgraph of that is isomorphic to a graph H. For any graph admitting H-covering, a total labelling β : VΓ ∪EΓ→{1, 2, …, p} is called an H-irregular ...
Wahyujati Mohamad Fahruli, Susanti Yeni
doaj +3 more sources
Further Results on (a, d) -total Edge Irregularity Strength of Graphs
مجلة بغداد للعلوم, 2023 Consider a simple graph on vertices and edges together with a total labeling . Then ρ is called total edge irregular labeling if there exists a one-to-one correspondence, say defined by for all where Also, the value is said to be the edge weight
MUTHUGURUPACKIAM1 K +3 more
doaj +2 more sources
Total Absolute Difference Edge Irregularity Strength of Graphs
Kragujevac Journal of Mathematics, 2022 We introduce a new graph characteristic, the total absolute difference edge irregularity strength. We obtain the estimation on the total absolute difference edge irregularity strength and determine the precise values for some families of graphs.
Ramalakshmi, R., Kathiresan, Km.
openaire +2 more sources