Total edge irregularity strength of disjoint union of double wheel graphs
Author
Jeyanthi, P.
Sudha, A.
Abstract
An edge irregular total k-labeling f : V ∪ E → {1, 2, 3,...,k} of a graph G = (V, E) is a labeling of vertices and edges of G in such a way thatfor any two different edges uv and u'v' their weights f (u) + f (uv) + f (v) and f (u') + f (u'v') + f (v') are distinct. The total edge irregularity strength tes(G) is defined as the minimum k for which the graph G has an edge irregular total k-labeling. In this paper, we determine the total edge irregularity strength of disjoint union of p isomorphic double wheel graphs and disjoint union of p consecutive non-isomorphic double wheel graphs.
Metadata
Show full item recordRelated items
Showing items related by title, author, creator and subject.
-
Total edge irregularity strength of disjoint union of double wheel graphs
Jeyanthi, P.; Sudha, A.. Proyecciones. Journal of Mathematics; Vol 35 No 3 (2016); 251-262 -
Total irregularity strength of some cubic graphs
Ibrahim, Muhammad; Khan, S.; Asim, Muhammad Ahsan; Waseem , Muhammad. Proyecciones (Antofagasta, On line); Vol. 40 No. 4 (2021); 905-918 -
On the total irregularity strength of convex polytope graphs
Bokhary, Syed Ahtshma Ul Haq; Imran, Muhammad; Ali, Usman. Proyecciones (Antofagasta, On line); Vol. 40 No. 5 (2021); 1267-1277