Unit V Matching Covering definition and properties A covering of a graph G is minimal if and only if G contains no path of length 3 or more. minimisation of switching function - an application of covering Page : 93,94,95,96
No download links available.
