Linear Algebra and Its Applications · Problem 2.5.17

Vector Spaces — Gilbert Strang

Mathematics · graphs-and-networks

Problem

For both graphs drawn below, verify Euler's formula: (# of nodes)−(# of edges)+(# of loops)=1.(\text{\# of nodes}) - (\text{\# of edges}) + (\text{\# of loops}) = 1.

Browse the problem library