Abstract
We investigate a refinement of the local, average and closed binding number of a graph in terms of mean closed binding number. Like the closed binding number itself, the mean closed binding number cbind mof G measures graph vulnerability, which is more sensitive. In this study, we define the parameter and find some bounds on the mean closed binding number of some special graphs. Further, some results have been obtained from graph operations. The closed binding degree of a graph is defined and its value for different graphs is obtained.
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.
