Recomienda este artículo a tus amigos:
Reducibility of Graphs and Digraphs Akram Attar
Precio
Mex$ 1.013
sin IVA
Pedido desde almacén remoto
Entrega prevista 29 de jun. - 9 de jul.
Nuestros clientes opinan:
Añadir a tu lista de deseos de iMusic
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
| Medios de comunicación | Libros Paperback Book (Libro con tapa blanda y lomo encolado) |
| Publicado | 26 de junio de 2013 |
| ISBN13 | 9783659408458 |
| Editores | LAP Lambert Academic Publishing |
| Páginas | 148 |
| Dimensiones | 228 × 152 × 18 mm · 226 g |
| Lengua | Inglés |
Ver todo de Akram Attar ( Ej. Paperback Book )