41
An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices are
Answer: all of even degree
Answer: all of even degree
Answer: Transitive
Article and Schedule Quiz | Start Test! |
Answer: 963/1000
Answer: max { d(u,v): u belongs to v, u does not equal to v : where d(u,v) is the distance between u&v}
Answer: K-regular graph
Answer: 5
Answer: 870
Answer: 7
Answer: 120
Answer: 2