Abstract
Let k be a positive integer. Let G be a graph of order $$n\ge 3$$nź3 and W a subset of V(G) with $$|W|\ge 3k$$|W|ź3k. Wang (J Graph Theory 78:295---304, 2015) proved that if $$d(x)\ge 2n/3$$d(x)ź2n...
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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.
