Open mblohr opened 9 years ago
Can a graph attribute be something as simple as whether or not a graph is directed or contains self-loops?
Strictly speaking, both of those things could be determined as a function of the edge set, so I wouldn't think so.
Why does this mean that it can't be a graph attribute?
Can a graph attribute be something as simple as whether or not a graph is directed or contains self-loops?