Ask your own question, for FREE!
Mathematics 8 Online
OpenStudy (anonymous):

Is there a proof to show that for every graph G and vertex v in V(G), that 0 =< deg(v) =< |V(G)|-1

OpenStudy (anonymous):

Hmm. Doesn't look very clear. What it's saying is that for every graph G and vertex \[v \in V(G)\], then \[0 \le \deg(v) \le |V(G)|-1\]

OpenStudy (anonymous):

is there anyway to prove this?

OpenStudy (anonymous):

what is deg(v) ?

OpenStudy (anonymous):

the degree of vertex v

OpenStudy (anonymous):

is this for topology ?

OpenStudy (anonymous):

it is related but i am doing the general graph theory subject

OpenStudy (anonymous):

sry, no idea in graph theory, good luck

OpenStudy (anonymous):

it's ok. thanks anyway (:

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!
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!