Results 31 to 40 of about 3,517 (256)
A Note on Edge Irregularity Strength of Some Graphs
Indonesian Journal of Combinatorics, 2020 Let G(V, E) be a finite simple graph and k be some positive integer. A vertex k-labeling of graph G(V,E), Φ : V → {1,2,..., k}, is called edge irregular k-labeling if the edge weights of any two different edges in G are distinct, where the edge weight of
I Nengah Suparta, I Gusti Putu Suharta
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
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 +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
Total edge irregularity strength of large graphs
Discrete Mathematics, 2012 Let $m:=|E(G)|$ sufficiently large and $s:=(m-1)/3$. We show that unless the maximum degree $ > 2s$, there is a weighting $w:E\cup V\to \{0,1,...,s\}$ so that $w(uv)+w(u)+w(v)\ne w(u'v')+w(u')+w(v')$ whenever $uv\ne u'v'$ (such a weighting is called {\em total edge irregular}).
openaire +3 more sources
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
Total Face Irregularity Strength of Grid and Wheel Graph under K-Labeling of Type (1, 1, 0)
Journal of Mathematics, 2021 In this study, we used grids and wheel graphs G=V,E,F, which are simple, finite, plane, and undirected graphs with V as the vertex set, E as the edge set, and F as the face set.
Aleem Mughal, Noshad Jamil
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
The Modular Irregularity Strength of C_n⊙mK_1
InPrime, 2022 Let G(V, E) be a graph with order n with no component of order 2. An edge k-labeling α: E(G) →{1,2,…,k} is called a modular irregular k-labeling of graph G if the corresponding modular weight function wt_ α:V(G) → Z_n defined by wt_ α(x) =Ʃ_(xyϵE(G)) α ...
Putu Kartika Dewi
doaj +1 more source
Total Edge Irregularity Strength for Graphs
, 2017 An edge irregular total $k$-labelling $f : V(G)\cup E(G)\rightarrow \{1,2,\dots,k\}$ of a graph $G$ is a labelling of the vertices and the edges of $G$ in such a way that any two different edges have distinct weights. The weight of an edge $e$, denoted by $wt(e)$, is defined as the sum of the label of $e$ and the labels of two vertices which incident ...
Irwansyah, M, Salman A. N.
openaire +2 more sources