Abstract
Let G be a connected undirected graph without loops and multiple edges. By , and we, respectively, denote the order, the nullity, and the matching number of G. Let , and let be a nonnegative integer defined as: To make G to be a bipartite connected graph at least edges of G must be deleted from G. In this note, applying an operation called bipartite double, we prove that for an arbitrary connected graph G. This result improves a main result in Wang and Wong [Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank. Disc Appl Math. 2014;166:276–281] saying that for a connected graph G.
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.
