Abstract
A k-labeling from the vertex set of a simple graph G=(V,E) to a set of integers {1,2,…,k} is defined to be a modular edge irregular if, for every couple of distinct edges, their modular edge weights are distinct. The modular edge weight is the remainder of the division of the sum of end vertex labels by modulo |E(G)|. The modular edge irregularity strength of a graph is known as the maximal vertex label k, minimized over all modular edge irregular k-labelings of the graph. In this paper we describe labeling schemes with symmetrical distribution of even and odd edge weights and investigate the existence of (modular) edge irregular labelings of joins of paths and cycles with isolated vertices. We estimate the bounds of the (modular) edge irregularity strength for the join graphs Pn+Km¯ and Cn+Km¯ and determine the corresponding exact value of the (modular) edge irregularity strength for some fan graphs and wheel graphs in order to prove the sharpness of the presented bounds.
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.
