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.
Opracovaný příklad · sum of k for k = 1 to 5
Krok za krokem
- \sum_{k=1}^{5} k
Write the sum out.
- 1 + 2 + 3 + 4 + 5
Expand the terms.
- = 15
Closed form.
Odhalte odpověď
Teď ty. Vyberte si problém, nebo zadejte nebo nakreslit vlastní. Každý krok, obrázek, odpověď skrytou, dokud se zeptáte.
Volný účet přidává poznámky k každé lekci, záznam o tom, co jste dokončili, vaše vyřešené problémy na jednom místě, a doučování můžete požádat o tuto stránku. Matematika sama je otevřena pro každého, zaregistrované nebo ne.
Zaregistrovat se PřihlášeníZde použité symboly
Ťukněte na jakýkoliv symbol pro úplnou definici, obrázek a co každé písmeno v něm znamená.
Jak se: Graphs: vertices, edges, degrees
- Write the sum out.
- Expand the terms.
- Closed form.
Otázky, které se lidé ptají
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.
Více v 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