Abstract
In this paper, we present an algorithm to find triangular fuzzy star graph K1, n atmost 1241 edges. We show that it admits triangular fuzzy labeling. Also we prove that it satisfies triangular fuzzy graceful labeling.
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.
