Results 11 to 20 of about 619 (170)
On the total vertex irregularity strength of comb product of two cycles and two stars
Indonesian Journal of Combinatorics, 2020 Let G = (V(G),E(G)) be a graph and k be a positive integer. A total k-labeling of G is a map f : V ∪ E → {1,2,3,...,k}. The vertex weight v under the labeling f is denoted by w_f(v) and defined by w_f(v) = f(v) + \sum_{uv \in{E(G)}} {f(uv)}.
Rismawati Ramdani
doaj +1 more source
On Vertex Irregular Total k-labeling and Total Vertex Irregularity Strength of Lollipop Graphs
Journal of Physics: Conference Series, 2019 Abstract Let G be a connected graph with vertex set V(G) and edge set E(G). A vertex irregular total k-labeling λ : V ( G ) ∪
Siti’ Aisyah Nur Ni’mah +1 more
openaire +1 more source
Total vertex irregularity strength for trees with many vertices of degree two
Electronic Journal of Graph Theory and Applications, 2020 For a simple graph G = (V,E), a mapping φ : V ∪ E → {1,2,...,k} is defined as a vertex irregular total k-labeling of G if for every two different vertices x and y, wt(x) ≠ wt(y), where wt(x) = φ(x)+ Σxy∈E(G) φ(xy).
Rinovia Simanjuntak +2 more
doaj +1 more source
Computation of Total Vertex Irregularity Strength of Theta Graphs
IEEE Access, 2019 A total labeling $\phi: V(G)\cup E(G) \to \{1,2, {\dots }, k\}$ is called a vertex irregular total $k$ -labeling of a graph $G$ if different vertices in $G$ have different weights.
Ali N. A. Koam, Ali Ahmad
doaj +1 more source
Total vertex irregularity strength of comb product of two cycles
MATEC Web of Conferences, 2018 Let G = (V (G),E(G)) be a graph and k be a positive integer. A total k-labeling of G is a map f : V (G) ∪ E(G) → {1,2...,k}. The vertex weight v under the labeling f is denoted by Wf(v) and defined by Wf(v) = f(v) + Σuv∈E(G)f(uv). A total k-labeling of G
Ramdani Rismawati, Ramdhani Muhammad Ali
doaj +1 more source
On irregularity strength of disjoint union of friendship graphs
Electronic Journal of Graph Theory and Applications, 2013 We investigate the vertex total and edge total modication of the well-known irregularity strength of graphs. We have determined the exact values of the total vertex irregularity strength and the total edge irregularity strength of a disjoint union of ...
Ali Ahmad, Martin Baca, Muhammad Numan
doaj +1 more source
Note on edge irregular reflexive labelings of graphs
AKCE International Journal of Graphs and Combinatorics, 2019 For a graph G, an edge labeling fe:E(G)→{1,2,…,ke}and a vertex labeling fv:V(G)→{0,2,4,…,2kv}are called total k-labeling, where k=max{ke,2kv}. The total k-labeling is called an edge irregular reflexive k-labeling of the graph G, if for every two ...
Martin Bača +4 more
doaj +1 more source
The total disjoint irregularity strength of some certain graphs
Indonesian Journal of Combinatorics, 2020 Under a totally irregular total k-labeling of a graph G = (V, E), we found that for some certain graphs, the edge-weight set W (E) and the vertex-weight set W (V ) of G which are induced by k=ts(G), W(E)∩W(V) is a non empty set.
Meilin I Tilukay, A. N. M. Salman
doaj +1 more source
Totally irregular total labeling of some caterpillar graphs
Electronic Journal of Graph Theory and Applications, 2020 Assume that G(V,E) is a graph with V and E as its vertex and edge sets, respectively. We have G is simple, connected, and undirected. Given a function λ from a union of V and E into a set of k-integers from 1 until k.
Diari Indriati +4 more
doaj +1 more source
Indonesian Journal of Combinatorics, 2020 Given graph G(V,E). We use the notion of total k-labeling which is edge irregular. The notion of total edge irregularity strength (tes) of graph G means the minimum integer k used in the edge irregular total k-labeling of G.
Isnaini Rosyida, Diari Indriati
doaj +1 more source