Dagsarkiv: mars 27, 2013

Eulers polyederformula

Definition: A graph is called planar if can be drawn in one plane without any arcs crossing each other. Definintion: The graph G = (V,E) is called bipartite if the nodes can be divided into two disjunct parts V = … Fortsätt läsa

Publicerat i Algebra, Gymnasiematematik(high school math), matematik 5 | Märkt , | 2 kommentarer