Abstract
Let be a simple graph and be the set of all integers. An integral sum graph of a set of integers as the graph having as its vertex set, with two vertices adjacent whenever their sum is in A graph so obtained is called an integral sum graph. In other words, an integral sum graph of a finite subset is the graph with if and only if And is called an integral sum labelling of In the paper, many obtained conclusions are summarized and relevant open problem is raised.
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 callMore From: International Journal of Applied Mathematics and Machine Learning
Disclaimer: 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.
