Reducibility of Graphs is one of the importent subject in the restrection problem in Graph Theory.In fact the deletion of vertices(edges) from the graph with certain property, may not maintain the property of the graph. When the graph maintain its property after deletion vertex(edge) from its vertex(edge) set means that we can study the graph with fewer vertices(edges) which simpilfie our study for this graph.
|Author||Akram Attar and Baloo Waphare|
|Number of Pages||148|
|Country of Manufacture||India|
|Product Brand||LAP LAMBERT Academic Publishing|
|Product Packaging Info||Box|
|In The Box||1 Piece|
|Product First Available On ClickOnCare.com||2015-07-08 00:00:00|