Abstract
The deficiency of a graph $G$, denoted $def(G)$, is defined as the number of vertices which are not matched by a maximum matching in G. A graph $G$ is called $\beta$ - deficient if $def(G) \leq \beta$. In this note, we present sufficient condition for the connected $\beta$ - deficient graphs.
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 callMore From: International Journal of Mathematics and Soft Computing
Paper Title
Journal
Date
