Abstract
<abstract><p>Graph labeling is an assignment of (usually) positive integers to elements of a graph (vertices and/or edges) satisfying certain condition(s). In the last two decades, graph labeling research received much attention from researchers. This articles is about edge irregularity strength for some classes of plane graphs. Edge irregularity strength denoted by $ es(G) $, was introduced by Ahmad et al. in 2014 as a modification of the well known irregularity strength by Chartrand in 1988. In this paper, the exact value of the edge irregularity strength for some clases of plane graphs is determined.</p></abstract>
Sign-in/Register to access full text options 
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.
