Tell your friends about this item:
Reducibility of Graphs and Digraphs Akram Attar
Reducibility of Graphs and Digraphs
Akram Attar
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.
Illustrations, black and white
| Media | Books Paperback Book (Book with soft cover and glued back) |
| Released | June 26, 2013 |
| ISBN13 | 9783659408458 |
| Publishers | LAP Lambert Academic Publishing |
| Pages | 148 |
| Dimensions | 228 × 152 × 18 mm · 226 g |
| Language | English |
See all of Akram Attar ( e.g. Paperback Book )