I remember when I was taking discrete analysis of data structures and we had to prove certain graph theory properties.(adsbygoogle = window.adsbygoogle || []).push({});

I'll give a specific example, prove that the cycle graph, [tex]C_n[/tex], is connected for all n.

From what I remember, it was induction we used to prove this...what I want to know is if there is any other way?

Oh yeah...I think this topic goes under general math...didn't see no graph theory categories..

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Graph theory (connectedness)

Loading...

Similar Threads - Graph theory connectedness | Date |
---|---|

I Use of irrational numbers for coordinate system | Sep 12, 2017 |

I Spectral Bisection of Simplest Graph Clearly Incorrect | Aug 18, 2017 |

I The complete graph K_n can be expressed as the union of k bipartite graphs iff n≤2^k | Jun 26, 2017 |

I The largest n such that K_n can be expressed as the union of | Apr 26, 2017 |

I Graph Theory: I need help understanding the corollaries | Apr 14, 2017 |

**Physics Forums - The Fusion of Science and Community**