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 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.
Highlights
All graphs considered here are finite, undirected, without loops or multiple edges
Graph labeling provides valuable information used in several application areas
We investigate the total irregularity strength of planar graphs
Summary
All graphs considered here are finite, undirected, without loops or multiple edges. Denote by. [3] Let G be a finite graph with p vertices, q edges and having maximum degree ∆ = ∆( G ), the upper square brackets represent the ceiling function, and tes( G ) ≥ max q+2. [3] Let G be a finite graph with p vertices, q edges, minimum degree δ = δ( G ) and maximum degree ∆ = ∆( G ), the upper square brackets represent the ceiling function, and lp+δm. [4] Let G be a finite graph with p vertices, q edges, different from K5 with minimum degree δ = δ( G ), maximum degree ∆ = ∆( G ), the upper square brackets represent the ceiling function, and tes( G ) = max. We investigate the total irregularity strength of planar graphs
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
