Verify that in an undirected graph, the "is reachable from" relation is an equivalence relation on the vertices of the graph. Which of the three properties of an equivalence relation hold in general for the "is reachable from" relation on vertices of a directed graph?(adsbygoogle = window.adsbygoogle || []).push({});

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

# Question on Graph

Loading...

Similar Threads for Question Graph | Date |
---|---|

I Astrodynamics Question: Derivation of Sp. Orbital Energy? | Apr 6, 2018 |

I Direct Products of Modules ...Another Question ... ... | Mar 31, 2018 |

I Correspondence Theorem for Groups ... Another Question ... | Mar 24, 2018 |

Basic Graph Theory Question | Oct 23, 2014 |

Question on Graph theory | Mar 2, 2005 |

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