Total Edge Irregularity Strength of Butterfly Networks
Indra Rajasingh, Bharati Rajan, S. Teresa Arockiamary · International Journal of Computer Applications · 2012
Given a graph G (V, E) a labeling : VE{1, 2… k} is called an edge irregular total k-labeling if for every pair of distinct edges uv and xy, (u) + (uv) + (v) (x) + (xy) + (y).The minimum k for which G has an edge irregular total k-labeling is called the total edge irregularity strength of G.In this paper we examine the butterfly network which is a well known interconnection network, and obtain its total edge irregularity strength.