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.
कार्यरत उदाहरण · sum of k for k = 1 to 5
चरणानुक्रमे
- \sum_{k=1}^{5} k
Write the sum out.
- 1 + 2 + 3 + 4 + 5
Expand the terms.
- = 15
Closed form.
उत्तर उघडा
आता तुम्ही प्रश्न निवडा, किंवा स्वतःचा प्रश्न टाइप करा किंवा रेखाटून दाखवा. प्रत्येक टप्प्यात, चित्रे आहेत, तुम्ही विचारण्याआधी उत्तर लपवलेले आहे.
मोफत खाते प्रत्येक शिकवणी वर टिपण्णी जोडते, तुम्ही पूर्ण केलेल्या गोष्टीचा नोंदवही, तुमच्या सोडविलेल्या समस्या एका ठिकाणी, आणि या पानाच्या विषयी तुम्ही विचारू शकता अशा शिक्षकाला. गणित स्वतःच सर्वांसाठी खुले आहे, दाखलन झालेले असो किंवा नसो.
नोंदणी करा दाखलनयेथे वापरलेले चिन्ह
Tap any symbol for the full definition, a picture, and what every letter in it means.
कसे कराल: Graphs: vertices, edges, degrees
- Write the sum out.
- Expand the terms.
- Closed form.
लोक विचारतात ते प्रश्न
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.
अधिक माहिती 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