Add to ORKGFor a simple graph G with the vertex set V and the edge set E, a labeling\ud is called a vertex irregular total k-labeling of\ud G, if for any two different vertices x and y in V, we have\ud where\ud The total vertex irregularity\ud strength of G, denoted by tvs(G), is the smallest positive integer k for\ud which G has a vertex irregular total k-labeling. In this paper, we determine\ud the total vertex irregularity strength of an amalgamation of stars
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 ...
A labeling of a \ud graph is a map that carries graph elements to the numbers (usually \ud pos...
AbstractWe investigate the following modification of the well-known irregularity strength of graphs....
Let $G=(V(G),E(G))$ be a graph and $k$ be a positive integer. A total $k$-labeling of $G$ is a map $...
Suppose G(V,E) is a graph, a function f : V \cup E \to \{1, 2, 3, \cdots, k\} is called the total ed...
AbstractA vertex irregular total k-labelling λ:V(G)∪E(G)⟶{1,2,…,k} of a graph G is a labelling of ve...
A total vertex irregular k-labeling φ of a graph G is a labeling of the vertices and edges of G with...
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 ...
AbstractLet G be a connected and simple graph with vertex set V(G) and edge set E(G). A total labeli...
AbstractLet G = (V, E) be a simple and undirected graph with a vertex set V and an edge set E. A tot...
<p>A simple graph G=(V(G),E(G)) admits an H-covering if every edge in E(G) belongs at least to one s...
AbstractA totally irregular total k-labeling λ: V ∪ E → {1, 2, · · ·, k} of a graph G is a total lab...
AbstractA vertex irregular total k-labelling λ:V(G)∪E(G)⟶{1,2,…,k} of a graph G is a labelling of ve...
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 ...
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 ...
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 ...
A labeling of a \ud graph is a map that carries graph elements to the numbers (usually \ud pos...
AbstractWe investigate the following modification of the well-known irregularity strength of graphs....
Let $G=(V(G),E(G))$ be a graph and $k$ be a positive integer. A total $k$-labeling of $G$ is a map $...
Suppose G(V,E) is a graph, a function f : V \cup E \to \{1, 2, 3, \cdots, k\} is called the total ed...
AbstractA vertex irregular total k-labelling λ:V(G)∪E(G)⟶{1,2,…,k} of a graph G is a labelling of ve...
A total vertex irregular k-labeling φ of a graph G is a labeling of the vertices and edges of G with...
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 ...
AbstractLet G be a connected and simple graph with vertex set V(G) and edge set E(G). A total labeli...
AbstractLet G = (V, E) be a simple and undirected graph with a vertex set V and an edge set E. A tot...
<p>A simple graph G=(V(G),E(G)) admits an H-covering if every edge in E(G) belongs at least to one s...
AbstractA totally irregular total k-labeling λ: V ∪ E → {1, 2, · · ·, k} of a graph G is a total lab...
AbstractA vertex irregular total k-labelling λ:V(G)∪E(G)⟶{1,2,…,k} of a graph G is a labelling of ve...
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 ...
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 ...
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 ...
A labeling of a \ud graph is a map that carries graph elements to the numbers (usually \ud pos...
AbstractWe investigate the following modification of the well-known irregularity strength of graphs....