You are here:

Advanced Math/graph question

Advertisement


Question
Let Q be the graph consisting of vertices and edges of a 3-dimensional cube. Two relations are defined on the vertices of Q.
  R1={(v,w):the shortest path from v to w has an odd number of edges}.
  R2={(v,w):the shortest path from v to w has an even number of edges.

a) Exactly one of R1 and R2 is an equivalence relation

b) Both R1 and R2 are equivalence relations

c) None of R1 and R2 is an equivalence relation

Thank you very much.

Answer
Equivalence relation
Equivalence relation  
Note:  this is a revised answer

Advanced Math

All Answers


Answers by Expert:


Ask Experts

Volunteer


Sombra Shadow

Expertise

I can answer most questions up through Calculus and some in Number Theory and Abstract Algebra.

Experience

I have had my Bachelor's Degree since 1987 and have been a teacher since 1988. I earned my Masters Degree in Mathematics May 2010. I have been teaching at the same community college since 2002.

Education/Credentials
I have taught 12 years at the community college level, medical college, and technical college as well as a high school instructor and alternative education instructor and charter school instructor.

Awards and Honors
Master's GPA 3.56 Bachelor's GPA 3.34 Post grad work not degree related GPA 4.0

©2016 About.com. All rights reserved.