Topics
disjoint unionMilitary conflict
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 friendship graphs
AbstractAn assignment of positive integer weights to the edges of a simple graph G is called irregul...
AbstractA total edge irregular k-labelling ν of a graph G is a labelling of the vertices and edges o...
A simple graph G=(V(G),E(G)) admits an H-covering if every edge in E(G) belongs at least to one subg...
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...
In computer science, graphs are used in variety of applications directly or indirectly. Especially q...
AbstractIn this paper, we investigate the new graph characteristic, the edge irregularity strength, ...
Two new graph characteristics, the total vertex irregularity strength and the total edge irregularit...
AbstractTwo new graph characteristics, the total vertex irregularity strength and the total edge irr...
AbstractLet G = (V, E) be a simple and undirected graph with a vertex set V and an edge set E. A tot...
A total vertex irregular k-labeling φ of a graph G is a labeling of the vertices and edges of G with...
Many networks have been found the total edge irregularity strength???s. In this paper, we found that...
Let ðº = (ð‘‰, ð¸) be a graph. A total labeling ð‘“: 𑉠∪ ð¸ → {1, 2, ⋯ , ð‘˜} iscalled a tot...
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...
AbstractAn assignment of positive integer weights to the edges of a simple graph G is called irregul...
AbstractA total edge irregular k-labelling ν of a graph G is a labelling of the vertices and edges o...
A simple graph G=(V(G),E(G)) admits an H-covering if every edge in E(G) belongs at least to one subg...
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...
In computer science, graphs are used in variety of applications directly or indirectly. Especially q...
AbstractIn this paper, we investigate the new graph characteristic, the edge irregularity strength, ...
Two new graph characteristics, the total vertex irregularity strength and the total edge irregularit...
AbstractTwo new graph characteristics, the total vertex irregularity strength and the total edge irr...
AbstractLet G = (V, E) be a simple and undirected graph with a vertex set V and an edge set E. A tot...
A total vertex irregular k-labeling φ of a graph G is a labeling of the vertices and edges of G with...
Many networks have been found the total edge irregularity strength???s. In this paper, we found that...
Let ðº = (ð‘‰, ð¸) be a graph. A total labeling ð‘“: 𑉠∪ ð¸ → {1, 2, ⋯ , ð‘˜} iscalled a tot...
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...
AbstractAn assignment of positive integer weights to the edges of a simple graph G is called irregul...
AbstractA total edge irregular k-labelling ν of a graph G is a labelling of the vertices and edges o...
A simple graph G=(V(G),E(G)) admits an H-covering if every edge in E(G) belongs at least to one subg...
Add to ORKG