Abstract
LetG(V,E) be a simple graph, the edge-binding number b1 (G) ofG is defined as $$b_1 (G) = \min \left\{ {\left. {\frac{{|N(S)|}}{{|S|}}} \right|\emptyset \ne S \subset E,N(S) \ne E} \right\},$$ whereN(S) denotes the adjacent edges set ofS. In this paper, we obtained the edge-binding number of outer plane graphs, Halin graph and tree.
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.
