maths.free › Combinatorics & Graph Theory › Graphs: vertices, edges, degrees

Graphs: vertices, edges, degrees

The basic objects of graph theory and the handshake lemma.

A graph is a set of vertices with edges between some pairs. The handshake lemma: the degrees sum to twice the number of edges, so the number of odd-degree vertices is even. Picture it: dots and lines; a complete graph on 5 vertices has 10 edges, which is 5 choose 2. Think it: graphs are relations drawn; the adjacency matrix makes them linear algebra.

Esempio svolto · sum of k for k = 1 to 5

Calculus · Series-And-Sums

Sum k for k = 1 to 5

\sum_{k=1}^{5} k

Passo dopo passo

  1. \sum_{k=1}^{5} k

    Write the sum out.

  2. 1 + 2 + 3 + 4 + 5

    Expand the terms.

  3. = 15

    Closed form.

Rivela la risposta
15

Ora tu Scegli un problema, o digitare o disegnare il proprio. Ogni passo, un'immagine, la risposta nascosta fino a quando non si chiede.

Conserva il tuo lavoro

Un account gratuito aggiunge note su ogni lezione, un record di ciò che hai finito, i tuoi problemi risolti in un unico luogo, e un tutor che puoi chiedere su questa pagina. La matematica stessa è aperta a tutti, firmato o no.

Iscriviti Accesso

Simboli utilizzati qui

Toccare qualsiasi simbolo per la definizione completa, un'immagine, e che cosa ogni lettera in esso significa.

Come: Graphs: vertices, edges, degrees

  1. Write the sum out.
  2. Expand the terms.
  3. Closed form.

Domande che la gente chiede

Permutation or combination?

Ask whether order matters. A lock code is a permutation (order matters); a hand of cards is a combination (it does not).

What is a graph in this sense?

Dots (vertices) joined by lines (edges), not a plot. Road maps, social networks and molecules are graphs; questions like "is there a route" and "how few colours" are graph theory.

Altro in Combinatorics & Graph Theory

The counting principlesPigeonhole principle and inclusion, exclusionBinomial coefficients and Pascal's triangleRecurrences and generating functionsPaths, cycles, trees, Euler and HamiltonColouring and planar graphs