Advertisement
Published in:
2011 | OriginalPaper | Chapter
Irregular Total Labeling of Butterfly and Benes Networks
Authors : Indra Rajasingh, Bharati Rajan, S. Teresa Arockiamary
Published in: Informatics Engineering and Information Science
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Given a graph
G
(
V
,
E
), a labeling ∂:
V
∪
E
→ {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
) + ∂ (
y
) + ∂ (
xy
). 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 total edge irregularity strength of the butterfly and the benes network.