Some new formulae on Δ–optimum exclusive sum labeling of certain trees. (3rd March 2016)

• Record Type: Journal Article
• Authors: Samal, R. K.; Mishra, D.
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 19:Number 2(2016)
• Page Start: 397
• Page End: 403
• Publication Date: 2016-03-03
• Subjects: Exclusive sum graph -- Exclusive sum number -- Exclusive sum labeling -- Paths -- Stars -- Double stars or Bistars -- Combs; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2015.1102958
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: All sum graphs are disconnected. The notions of sum labeling and sum graphs were introduced by Harary [1] and later extended to include all integers [2]. A mapping L is called a sum labeling a graph H ( V ( H ), E ( H )) if it is an injection from V ( H ) to a set of positive integers such that xy ∈ E ( H ) if and only if there exists a vertex w ∈ V ( H ) such that L ( w )= L ( x ) + L ( y ). In this case w is called a working vertex. We call L as an exclusive sum labeling of a graph G if it is sum labeling of for some non negative integer r and G contains no working vertex. In general, a graph G will require some isolated vertices to be labeled exclusively. The least possible number of such isolated vertices is called exclusive sum number of G, denoted by ∈( G ). An exclusive sum labeling of a graph G is said to be optimum if it labels G exclusively by using ∈( G ) isolated vertices. In case ∈( G )=Δ( G ), where D( G ) denotes the maximum degree of vertices in G, the labeling is called Δ- optimum exclusive sum labeling. In this paper we developed some new formulae to find Δ- optimum exclusive sum labeling of certain trees.