Pastāsti draugiem par šo preci:
Reducibility of Graphs and Digraphs Akram Attar
Cena
€ 69,49
Pasūtīts no attālās noliktavas
Paredzamā piegāde . gada 11. - 25. aug.
Saņemiet paziņojumus par jauniem Akram Attar izdevumiem
Mūsu klienti saka:
Pievienot savam iMusic vēlmju sarakstam
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
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2013. gada 26. jūnijs |
| ISBN13 | 9783659408458 |
| Izdevēji | LAP Lambert Academic Publishing |
| Lapas | 148 |
| Izmēri | 228 × 152 × 18 mm · 226 g |
| Valoda | Angļu |
Skatīt visus Akram Attar ( piem., Paperback Book )