Ask
your own question, for FREE!
Mathematics
15 Online
Let G be a graph with V={1,2,...100}, where x,y have an edge connecting them if |x-y|=2 or |x-y|=8. Is G connected? Prove your claim. A connected graph is a graph in which for any 2 vertices there is a path connecting them.
Still Need Help?
Join the QuestionCove community and study together with friends!
I just thought of something. If 2 vertices are only connected when you have a difference of 2 or 8 (both of which are even) then any odd vertex can't be connect to any even vertex (since an even and an odd number can only have an odd difference). This means that the graph is not connected.
Can't find your answer?
Make a FREE account and ask your own questions, OR help others and earn volunteer hours!
Join our real-time social learning platform and learn together with your friends!
Join our real-time social learning platform and learn together with your friends!
Latest Questions
serenitystXrgazer:
Getting sent to anti gay christian covestion camp in a few weeks, any tips. guys i think im cooked.
Aubree:
Guys, what does love feel like? I've been getting a tight chest and when I talk to him my heart rate hangs out around 100-120 beats per min, and when he doe
thereneelg:
ok... anyone have advice?? ...I did Choir all throughout Middle school and have ALWAYS been put in Soprano those three years.
kamariana:
The Byzantine Procopius is known for (5 points) reconquering much of the old Roma
chuckD:
hellp!!! what does it mean to describe a scientist as skeptical Why is sceptical
DoltonCarlee:
So like do y'all know anything about the first world war?
thehearken:
anyone know how to explain this so its easier for me to understand? b(1)=2, b(n)=
2 hours ago
1 Reply
0 Medals
8 hours ago
10 Replies
2 Medals
2 days ago
6 Replies
1 Medal
3 days ago
0 Replies
0 Medals
3 days ago
2 Replies
1 Medal
2 days ago
2 Replies
0 Medals
2 days ago
5 Replies
2 Medals