Abstract
In this paper we observed the definition of folding technique in graph theory and we derived the corresponding automaton for trees. Also derived some propositions on symmetrical structure tree, non-symmetrical structure tree, point symmetrical structure tree, edge symmetrical structure tree along with finite number of points. This approach provides to derive one edge after n’ number of foldings.
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.
