One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage Plus
Audio Papers
Ask R Discovery
Translation
Auto-sync
Collaboration
https://doi.org/10.37418/amsj.14.1.3
Copy DOI
Export
Save
Share
Cite Publication Date: Jan 25, 2025 |
We call an undirected graph with $n$ edges \textit{totally anti-magic} if in every labelling of edges by the numbers $1,2,\dots, n$ all nonzero vertex sums are distinct. We study totally anti-magic disjoint unions of stars and adding whiskers to any graph to achieve a totally anti-magic graph.
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.
