Question

Topic: Discrete Mathematics and its Applications" Chapter 10: Graph Terminology and Special Types of Graphs,"

v(v - 1) u Variation on 10.2# 61. If a sim ple graph G h how many edges does G, the complement of G, have? 3. as v vertices and * -k edges. Answer: Explanaion:

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Let G be a simple undirected graph, so maximum number of edges with v vertices is v(v-1)/2. So, G' will have v(v-1)/2 - (v(v-1)/4 - k) = v(v-1)/4 + k.

So G' contains v(v-1)/4 + k edges.

Add a comment
Know the answer?
Add Answer to:
Topic: Discrete Mathematics and its Applications" Chapter 10: Graph Terminology and Special Types of Graphs," v(v...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT