(2, 1)-total labelling of planar graphs with large maximum degree. (17th November 2017)

• Record Type: Journal Article
• Authors: Yu, Yong; Zhang, Xin; Wang, Guanghui; Liu, Guizhen; Li, Jinbo
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 20:Number 8(2017)
• Page Start: 1625
• Page End: 1636
• Publication Date: 2017-11-17
• Subjects: (2, 1)-total labelling -- Planar graphs -- Discharging; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2016.1139850
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: In this paper, we prove for planar graph G with maximum degree Δ ≥ 12 that the (2, 1)-total labelling number λ 2 ( G ) is at most Δ + 2.