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.

Radni primjer · sum of k for k = 1 to 5

Calculus · Series-And-Sums

Sum k for k = 1 to 5

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

Korak po korak

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

    Write the sum out.

  2. 1 + 2 + 3 + 4 + 5

    Expand the terms.

  3. = 15

    Closed form.

Otkrij odgovor
15

Sada ti Izaberite problem, ili upišite ili nacrtajte svoj, svaki korak, slika, odgovor skriven dok ga ne pitate.

Neka tvoja radi.

Besplatni račun dodaje bilješke na svaku lekciju, zapis onoga što ste završili, vaše riješene probleme na jednom mjestu, i tutora kojeg možete pitati o ovoj stranici. Sama matematika je otvorena za svakoga, prijavljenog ili ne.

Prijavite se Prijava

Simboli korišteni ovdje

Dodirnite bilo koji simbol za potpunu definiciju, sliku i što svako slovo u njemu znači.

Kako: Graphs: vertices, edges, degrees

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

Pitanja koja ljudi postavljaju

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.

Više u 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