Show that a simple graph $G$ with $n$ vertices and $m$ components has at most $(n - 1)(n - m + 1) / 2$ edges. [closed]
Clash Royale CLAN TAG#URR8PPP
up vote
1
down vote
favorite
Show that a simple graph $G$ with $n$ vertices and $m$ components has at most $(n - 1)(n - m + 1) / 2$ edges.
How can we prove this using the graph teory? Can any one help me is it by qudratic equations?
discrete-mathematics graph-theory algebraic-graph-theory discrete-calculus
closed as off-topic by amWhy, Theoretical Economist, José Carlos Santos, Xander Henderson, Shailesh Aug 27 at 0:21
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." â amWhy, Theoretical Economist, José Carlos Santos, Xander Henderson, Shailesh
add a comment |Â
up vote
1
down vote
favorite
Show that a simple graph $G$ with $n$ vertices and $m$ components has at most $(n - 1)(n - m + 1) / 2$ edges.
How can we prove this using the graph teory? Can any one help me is it by qudratic equations?
discrete-mathematics graph-theory algebraic-graph-theory discrete-calculus
closed as off-topic by amWhy, Theoretical Economist, José Carlos Santos, Xander Henderson, Shailesh Aug 27 at 0:21
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." â amWhy, Theoretical Economist, José Carlos Santos, Xander Henderson, Shailesh
Welcome to Mathematics Stack Exchange !! We are here to help you with any kind of mathematical problems, but you have to show what you have tried. :)
â Anik Bhowmick
Aug 26 at 12:56
add a comment |Â
up vote
1
down vote
favorite
up vote
1
down vote
favorite
Show that a simple graph $G$ with $n$ vertices and $m$ components has at most $(n - 1)(n - m + 1) / 2$ edges.
How can we prove this using the graph teory? Can any one help me is it by qudratic equations?
discrete-mathematics graph-theory algebraic-graph-theory discrete-calculus
Show that a simple graph $G$ with $n$ vertices and $m$ components has at most $(n - 1)(n - m + 1) / 2$ edges.
How can we prove this using the graph teory? Can any one help me is it by qudratic equations?
discrete-mathematics graph-theory algebraic-graph-theory discrete-calculus
edited Aug 26 at 12:57
Jendrik Stelzner
7,58221037
7,58221037
asked Aug 26 at 12:54
dilushi rathnayaka
91
91
closed as off-topic by amWhy, Theoretical Economist, José Carlos Santos, Xander Henderson, Shailesh Aug 27 at 0:21
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." â amWhy, Theoretical Economist, José Carlos Santos, Xander Henderson, Shailesh
closed as off-topic by amWhy, Theoretical Economist, José Carlos Santos, Xander Henderson, Shailesh Aug 27 at 0:21
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." â amWhy, Theoretical Economist, José Carlos Santos, Xander Henderson, Shailesh
Welcome to Mathematics Stack Exchange !! We are here to help you with any kind of mathematical problems, but you have to show what you have tried. :)
â Anik Bhowmick
Aug 26 at 12:56
add a comment |Â
Welcome to Mathematics Stack Exchange !! We are here to help you with any kind of mathematical problems, but you have to show what you have tried. :)
â Anik Bhowmick
Aug 26 at 12:56
Welcome to Mathematics Stack Exchange !! We are here to help you with any kind of mathematical problems, but you have to show what you have tried. :)
â Anik Bhowmick
Aug 26 at 12:56
Welcome to Mathematics Stack Exchange !! We are here to help you with any kind of mathematical problems, but you have to show what you have tried. :)
â Anik Bhowmick
Aug 26 at 12:56
add a comment |Â
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Welcome to Mathematics Stack Exchange !! We are here to help you with any kind of mathematical problems, but you have to show what you have tried. :)
â Anik Bhowmick
Aug 26 at 12:56