Abstract
Let G=(V, E) be a graph. An L(3,2,1) labeling of G is a function such that for every , , and if . Let , a labeling is a labeling where all labels are not greater than . An ) number of , denoted by , is the smallest non-negative integer such that has a labeling. In this paper, we determine of banana graphs.
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.
