AbstractWe investigate the irregularity strength (s(G)) and total vertex irregularity strength (tvs(G)) of circulant graphs Cin(1,2,…,k) and prove that tvs(Cin(1,2,…,k))=⌈n+2k2k+1⌉, while s(Cin(1,2,…,k))=⌈n+2k−12k⌉ except if either n=2k+1 or if k is odd and n≡2k+1(mod4k), then s(Cin(1,2,…,k))=⌈n+2k−12k⌉+1
AbstractWe investigate the following modification of the well-known irregularity strength of graphs....
Many networks have been found the total edge irregularity strength???s. In this paper, we found that...
AbstractLet G = (V, E) be a simple and undirected graph with a vertex set V and an edge set E. A tot...
AbstractWe investigate the irregularity strength (s(G)) and total vertex irregularity strength (tvs(...
The irregularity strength of a simple graph is the smallest integer k for which there exists a weigh...
AbstractA totally irregular total k-labeling λ: V ∪ E → {1, 2, · · ·, k} of a graph G is a total lab...
For a simple graph G with the vertex set V and the edge set E, a labeling\ud is called a vertex irre...
An edge irregular total k-labeling f : V ∪ E → 1,2, ..., k of a graph G = (V,E) is a labeling of ver...
A labeling of a graph is an assignment that carries some sets of graph elements into numbers (usuall...
AbstractA vertex irregular total k-labelling λ:V(G)∪E(G)⟶{1,2,…,k} of a graph G is a labelling of ve...
AbstractLet G be a connected and simple graph with vertex set V(G) and edge set E(G). A total labeli...
International audienceLet G be a graph, and l:E(G) → {1,...,k} be a k-labelling of G, i.e., an assig...
<p>In computer science, graphs are used in variety of applications directly or indirectly. Especiall...
AbstractThe irregularity strength of a simple graph is the smallest integer k for which there exists...
AbstractAs an edge variant of the well-known irregularity strength of a graph G=(V,E) we investigate...
AbstractWe investigate the following modification of the well-known irregularity strength of graphs....
Many networks have been found the total edge irregularity strength???s. In this paper, we found that...
AbstractLet G = (V, E) be a simple and undirected graph with a vertex set V and an edge set E. A tot...
AbstractWe investigate the irregularity strength (s(G)) and total vertex irregularity strength (tvs(...
The irregularity strength of a simple graph is the smallest integer k for which there exists a weigh...
AbstractA totally irregular total k-labeling λ: V ∪ E → {1, 2, · · ·, k} of a graph G is a total lab...
For a simple graph G with the vertex set V and the edge set E, a labeling\ud is called a vertex irre...
An edge irregular total k-labeling f : V ∪ E → 1,2, ..., k of a graph G = (V,E) is a labeling of ver...
A labeling of a graph is an assignment that carries some sets of graph elements into numbers (usuall...
AbstractA vertex irregular total k-labelling λ:V(G)∪E(G)⟶{1,2,…,k} of a graph G is a labelling of ve...
AbstractLet G be a connected and simple graph with vertex set V(G) and edge set E(G). A total labeli...
International audienceLet G be a graph, and l:E(G) → {1,...,k} be a k-labelling of G, i.e., an assig...
<p>In computer science, graphs are used in variety of applications directly or indirectly. Especiall...
AbstractThe irregularity strength of a simple graph is the smallest integer k for which there exists...
AbstractAs an edge variant of the well-known irregularity strength of a graph G=(V,E) we investigate...
AbstractWe investigate the following modification of the well-known irregularity strength of graphs....
Many networks have been found the total edge irregularity strength???s. In this paper, we found that...
AbstractLet G = (V, E) be a simple and undirected graph with a vertex set V and an edge set E. A tot...