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

  • Thread starter Thread starter algonewbee
  • Start date Start date
  • Tags Tags
    Graph
algonewbee
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?
 
Physics news on Phys.org
What have you tried?
 

Thread 'The colorful world of ##2\times 2## complex matrices'

The world of 2\times 2 complex matrices is very colorful. They form a Banach-algebra, they act on spinors, they contain the quaternions, SU(2), su(2), SL(2,\mathbb C), sl(2,\mathbb C). Furthermore, with the determinant as Euclidean or pseudo-Euclidean norm, isu(2) is a 3-dimensional Euclidean space, \mathbb RI\oplus isu(2) is a Minkowski space with signature (1,3), i\mathbb RI\oplus su(2) is a Minkowski space with signature (3,1), SU(2) is the double cover of SO(3), sl(2,\mathbb C) is the...
View full post »

Similar threads

I Number of edges in a tree digraph
Replies
5
Views
2K
  • Poll Poll
Relativity Lorentz factor in textbooks on Special Relativity
Replies
18
Views
4K
Combining Graphs: Finding Solutions through Graph Homorphisms
Replies
6
Views
1K
Python Help solving a geometrical matching issue with Graph Neural Networks
Replies
1
Views
2K
MHB Reading Comprehensive - Transitivity Relation
Replies
1
Views
2K
MHB Find Algorithm for O(V*E) Transitive Closure of a Graph
Replies
11
Views
3K
Possible Number of Vertices for Graphs with Three Edge Connections
Replies
4
Views
1K
Difficulty Understanding 'Drag Crisis' (transitionary period from laminar to turbulent flow)
Replies
1
Views
1K
How Do I Calculate Actual Frequency from Wind Turbine Simulation Data?
Replies
11
Views
2K
Insights Introducing Relativity on Rotated Graph Paper: A Graphical Motivation
Replies
0
Views
2K

Hot Threads

Recent Insights

Back
Top