A community for students.
Here's the question you clicked on:
 0 viewing
dan815
 one year ago
Graph theory,
http://prntscr.com/8jsfnv
you guys know what this question is asking?
\[k_{m,n}\]
is a bipartite graph
\[k_n\]
is a complete graph of n vertices
\[W_y\] is a wheel with y+1 vertices where y vertices are arranged in a cycle and the y+1th vertex in adj to all the other y vertices
therefore a wheel W_n has an average degree of (4*n)/(n+1)
dan815
 one year ago
Graph theory, http://prntscr.com/8jsfnv you guys know what this question is asking? \[k_{m,n}\] is a bipartite graph \[k_n\] is a complete graph of n vertices \[W_y\] is a wheel with y+1 vertices where y vertices are arranged in a cycle and the y+1th vertex in adj to all the other y vertices therefore a wheel W_n has an average degree of (4*n)/(n+1)

This Question is Closed

Compassionate
 one year ago
Best ResponseYou've already chosen the best response.0Not a single bit. Now, toss some y = mx + b at me, and we'll talk.

dan815
 one year ago
Best ResponseYou've already chosen the best response.2they have some equations where bipartite graphs are equaling a complete graph that should only be possible when its a 1factor like a complete graph of only 2 vertices

dan815
 one year ago
Best ResponseYou've already chosen the best response.2http://prntscr.com/8jsnet here is the question beside the other questions so you have an idea of what this question is asking

dan815
 one year ago
Best ResponseYou've already chosen the best response.2im a little confused if C_n supposed to be Cycle of n vertices or its just a random graph, I know K_n is the compelte graph and Kn,m is the bipartite complete graph and W_n is the wheel n+1 graph that is confirmed for sure

dan815
 one year ago
Best ResponseYou've already chosen the best response.2it simply doesnt make sense if its a cycle though would it, like there can be no graph that satisfies all the conditions then

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0Yeah \(C_n\) usually denotes complete graphs on \(n\) vertices.

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0For the first equation, simplest case is \(C_3=K_3\)...

dan815
 one year ago
Best ResponseYou've already chosen the best response.2oh so do they want a solution for each relation

dan815
 one year ago
Best ResponseYou've already chosen the best response.2all these equations are not like suppsoed to be solved together?

dan815
 one year ago
Best ResponseYou've already chosen the best response.2that would make my life so much easier T_T

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0I think so. It's not apparent whether you're asked to solved them simultaneously or not. If yes, this seems pretty hard.

dan815
 one year ago
Best ResponseYou've already chosen the best response.2at this point im just gonna do that ive wasted needless time on this question all the other questions were very quick and simple, so im going to assume thats what they want for this too

dan815
 one year ago
Best ResponseYou've already chosen the best response.2thank you for the help!

dan815
 one year ago
Best ResponseYou've already chosen the best response.2im wondering if all C_2n = K_n,n would be a solution to this

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0Not true for \(K_{3,3}\), each vertex would have 3 adjacent vertices. All cycles' vertices must have degree no greater than 2.

dan815
 one year ago
Best ResponseYou've already chosen the best response.2oh right so C_4=k2,2 only one

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0For \(P_x=K_{y,z}\) it looks like you can only have one easy solution, assuming \(P_x\) is a path on \(x\) vertices.

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0Actually, there's more than just that one...

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0Yeah I'd missed that one. As well with \(K_{1,2}\).

zzr0ck3r
 one year ago
Best ResponseYou've already chosen the best response.0But anything higher that \(2,2\) is a graph with all verts with deg greater than 1, so that there is a cycle

dan815
 one year ago
Best ResponseYou've already chosen the best response.2i got K_4=W3 only one and K_2=K1,1 for the last one

dan815
 one year ago
Best ResponseYou've already chosen the best response.2yeah that makes sense to me
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.