Total Edge Irregularity Strength of Large Graphs

Details Total Edge Irregularity Strength of Large Graphs Total Edge Irregularity Strength of Large Graphs

2010-06-23

arxiv.org/abs/1006.4501v1

Mathematics

Combinatorics

14 pages

Scientific paper

Let $m:=|E(G)|$ sufficiently large and $s:=(m-1)/3$. We show that unless the maximum degree $\Delta > 2s$, there is a weighting $w:E\cup V\to \{0,1,...,s\}$ so that $w(uv)+w(u)+w(v)\ne w(u'v')+w(u')+w(v')$ whenever $uv\ne u'v'$ (such a weighting is called {\em total edge irregular}). This validates a conjecture by Ivanco and Jendrol' for large graphs, extending a result by Brandt, Miskuf and Rautenbach.

Affiliated with

Also associated with

No associations

Rating

Total Edge Irregularity Strength of Large Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Total Edge Irregularity Strength of Large Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Total Edge Irregularity Strength of Large Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-277901