Computing The Irregularity Strength of Planar Graphs
AbstractThe 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. View Full-Text
Share & Cite This Article
Yang, H.; Siddiqui, M.K.; Ibrahim, M.; Ahmad, S.; Ahmad, A. Computing The Irregularity Strength of Planar Graphs. Mathematics 2018, 6, 150.
Yang H, Siddiqui MK, Ibrahim M, Ahmad S, Ahmad A. Computing The Irregularity Strength of Planar Graphs. Mathematics. 2018; 6(9):150.Chicago/Turabian Style
Yang, Hong; Siddiqui, Muhammad K.; Ibrahim, Muhammad; Ahmad, Sarfraz; Ahmad, Ali. 2018. "Computing The Irregularity Strength of Planar Graphs." Mathematics 6, no. 9: 150.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.