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

Suppose \(G\) is a simple graph with \(p\) vertices and \(q\) edges.Prove that this graph has at least \(\large q(\frac{2q}{p} - 1 )\) paths with the length 2.

OpenStudy (anonymous):

help me and ill help you

OpenStudy (anonymous):

for example this is a path with length 2: |dw:1420628111055:dw|

ganeshie8 (ganeshie8):

*

ganeshie8 (ganeshie8):

@SithsAndGiggles

OpenStudy (dan815):

define simple graph

OpenStudy (anonymous):

i have some idea...maybe we know that the numbers of these paths are \[\Large\sum_{v \in V}^{} \left(\begin{matrix}\deg(v) \\ 2\end{matrix}\right)\]

OpenStudy (dan815):

are loops allowed

OpenStudy (anonymous):

as we can say that we chose 2 of the vertices

OpenStudy (anonymous):

@dan815 , hmm what do u mean?

OpenStudy (dan815):

im asking definition of simple graph

OpenStudy (anonymous):

He means can we have a situation like this:|dw:1420644272372:dw|

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!