Abstract
The vertex sum at each given vertex u is equal to the total of all the edges directed into it minus the sum of all the edges directed out of it. This is known as an anti magicl abeling of a directed graph G with v vertices and q edges. An antimagic digraph is a digraph that permits an antimagiclabeling. In this paper, we analyze a few antimagic digraph features and use hooked Skolem sequences to demonstrate the anti magicness of specific digraph families.
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 Innovative Research in Engineering and Management
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.
