Abstract
Let [Formula: see text] be a [Formula: see text] graph. An injective map [Formula: see text] is said to be an edge pair sum labeling if the induced vertex function [Formula: see text] defined by [Formula: see text] is one-to-one where [Formula: see text] denotes the set of edges in [Formula: see text] that are incident with the vertex [Formula: see text] and [Formula: see text] is either of the form [Formula: see text] or [Formula: see text] accordingly as [Formula: see text] is even or odd. A graph with an edge pair sum labeling is called an edge pair sum graph. In this paper, we prove that the graphs [Formula: see text], [Formula: see text], book graph and [Formula: see text] admit edge pair sum labeling.
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.
