Abstract
A SameSum graph is a graph whose vertices are inscribed with positive integers which are arranged in such a way that there are several subsets of the inscribed integers which sum to the same constant. An example of a SameSum graph is a Magic Square: the triplets of integers along the rows, along the columns and along the two diagonals of a magic square sum to the same magic constant of that specific square. Some recent results of the author of this article present several groups of SameSum graphs providing some additional examples. This article introduces the n-trigles, a new variant in the SameSum family, as a planar connected graph based on triangles only. The n-trigles are defined, their versatile properties are described and several examples are shown.
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.
