- Related Questions & Answers
- C++ Program for Zeckendorf's Theorem?
- C++ Program to Implement the Vizing’s Theorem
- C++ Program to Implement Fermat’s Little Theorem
- C++ Program to Implement Euler Theorem
- How to find a number using Pythagoras Theorem using C#?
- Rotate div to -20 degrees angle with CSS

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

If G = (V, E) be a non-directed graph with vertices V = {V_{1}, V_{2},…V_{n}} then

n ∑ i=1 deg(V_{i}) = 2|E|

If G = (V, E) be a directed graph with vertices V = {V_{1}, V_{2},…V_{n}}, then

n ∑ i=1 deg^{+}(V_{i}) = |E| = n ∑ i=1 deg^{−}(V_{i})

In any non-directed graph, the number of vertices with Odd degree is Even.

In a non-directed graph, if the degree of each vertex is k, then

k|V| = 2|E|

In a non-directed graph, if the degree of each vertex is at least k, then

k|V| = 2|E|

In a non-directed graph, if the degree of each vertex is at most k, then

k|V| = 2|E|

Advertisements