On one modulo three mean labeling of graphs. (3rd March 2016)

• Record Type: Journal Article
• Authors: Jeyanthi, P.; Maheswari, A.; Pandiaraj, P.
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 19:Number 2(2016)
• Page Start: 375
• Page End: 384
• Publication Date: 2016-03-03
• Subjects: One modulo three mean labeling -- one modulo three mean graphs; 05C78; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2015.1102838
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: A graph G is said to be one modulo three mean graph if there is an injective function ϕ from the vertex set of G to the set { a | 0≤ a ≤3 q – 2 and either a≡0 (mod 3) or a ≡1 (mod 3)} where q is the number of edges of G and ϕ induces a bijection ϕ* from the edge set of G to { a | 1≤ a ≤3 q – 2 and either a ≡1 (mod3)} given by and the function ϕ is called one modulo three mean labeling of G. In this paper, we show that the graphs and Cm * e Cn are one modulo three mean graphs.