when in a qestion we are given a graph with no description on the validity of such qualities as loops, hyper-edges etc. can we assume that the graph is simple by default? specificly I am reffering to q.01 ex 01 where it is not mentioned about the graph (apart from it being undirected)
Date: 02 Apr 2015 14:03
Number of posts: 2
RSS: New posts
Unless mentioned otherwise, you can always assume that the graph is simple. Just write that you assume it.
In hw1 q1 specifically I would advise against making that assumption (you can if you want, but it won't help you - if it helps you then you've done something wrong…)