Open AccessArticle
Computing The Irregularity Strength of Planar Graphs
by
Hong Yang 1, Muhammad Kamran Siddiqui 2,*, Muhammad Ibrahim 3, Sarfraz Ahmad 4 and Ali Ahmad 5
1
School of Information Science and Engineering, Chengdu University, Chengdu 610106, China
2
Department of Mathematics, COMSATS University Islamabad, Sahiwal Campus, Sahiwal 57000, Pakistan
3
Center for Advanced Studies in Pure and Applied Mathematics, Bahauddin Zakariya University Multan, Multan 60800, Pakistan
4
Department of Mathematics, COMSATS University Islamabad, Lahore Campus, Lahore 54000, Pakistan
5
College of Computer Science & Information Systems, Jazan University, Jazan 45142, Saudi Arabia
Cited by 8 | Viewed by 3713
Abstract
The field of graph theory plays a vital role in various fields. One of the important areas in graph theory is graph labeling used in many applications such as coding theory, X-ray crystallography, radar, astronomy, circuit design, communication network addressing, and data base
[...] Read more.
The field of graph theory plays a vital role in various fields. One of the important areas in graph theory is graph labeling used in many applications such as coding theory, X-ray crystallography, radar, astronomy, circuit design, communication network addressing, and data base management. In this paper, we discuss the totally irregular total
k labeling of three planar graphs. If such labeling exists for minimum value of a positive integer
k, then this labeling is called totally irregular total
k labeling and
k is known as the total irregularity strength of a graph
G. More preciously, we determine the exact value of the total irregularity strength of three planar graphs.
Full article
►▼
Show Figures