• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Reducibility of Graphs and Digraphs

Reducibility of Graphs and Digraphs

Paperback

General Mathematics

ISBN10: 365940845X
ISBN13: 9783659408458
Publisher: Lap Lambert Academic Pub
Published: Jun 26 2013
Pages: 148
Weight: 0.50
Height: 0.34 Width: 6.00 Depth: 9.00
Language: English
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.

Also in

General Mathematics