Is the Is Reachable From Relation an Equivalence Relation in Directed Graphs?

algonewbee · Sep 17, 2008

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?

dodo · Sep 18, 2008

What have you tried?

Is the Is Reachable From Relation an Equivalence Relation in Directed Graphs?

Thread 'About the existence of Hamel basis for vector spaces'

Similar threads

Hot Threads

I How to show ##p(x)=g(x)x\pm 1\in\Bbb{Q}[x]## is irreducible in ##\Bbb{Q}_{\Bbb{Z}}[x]##?

I Showing ##k[x_1,\ldots,x_n]/\mathfrak{a}## is finite dimensional

A Near-Rings with Noncommutative Addition and Two-Sided Distributivity

I How do we distinguish two different notations for cokernel and coimage?

I Localising a non integral domain at a prime

Recent Insights

Insights Why Entangled Photon-Polarization Qubits Violate Bell’s Inequality

Insights Quantum Entanglement is a Kinematic Fact, not a Dynamical Effect

Insights What Exactly is Dirac’s Delta Function? - Insight

Insights Relativator (Circular Slide-Rule): Simulated with Desmos - Insight

Insights Fixing Things Which Can Go Wrong With Complex Numbers

Insights Fermat's Last Theorem