Prabin Das

Learn More
  • Surajit Kr, Nath, P Das
  • 2013
In this paper, the well known concept of matching of graph theory has been discussed in the setting of semigraphs resulting in few new concepts like maximal vertex-saturated matching, minimal edge-saturated matching and optimum matching which have no parallels in graphs. In this connection, we record a number of characterizations of maximum matching and(More)
  • 1