Super edge trimagic total labeling of generalized prism and web graphs. (2nd January 2016)

• Record Type: Journal Article
• Authors: Regees, M.; Jayasekaran, C.
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 19:Number 1(2016)
• Page Start: 81
• Page End: 92
• Publication Date: 2016-01-02
• Subjects: Function -- Bijection -- Magic labeling -- Trimagic labeling; 05C78; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2015.1101880
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: An edge magic total labeling of a ( p, q ) graph is a bijection f : V ( G ) ∪ E ( G ) → 1, 2, … , p + q such that for each edge xy ∈ E ( G ), the value of f ( x ) + f ( xy ) + f ( y ) is a constant k . If there exists three constants k 1, k 2 and k 3 such that f ( x ) + f ( xy ) + f ( y ) is either k 1 or k 2 or k 3, it is said to be an edge trimagic total labeling. In this paper we prove that the generalized Prism G = C m  P n′ the generalized web graph WB ( C m′ n ) and the generalized web graph without centre WB0 ( C m′ n ) are super edge trimagic total graphs