Abstract
In this paper, we determine the maximum size of a graph of fixed order without isolated vertices which contains (fractional) matching of given size, which is a variation of some known results involving the maximum size of all graphs of fixed order containing matching of given size by Erdős and Gallai. As corollaries of our results, Turán-type results for a connected graph on (fractional) matching are obtained.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
