Register

If G is an undirected planar graph on
closed

• closed by
693 views
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
2 answers
1
shivani2010 asked Jun 12, 2016
4,326 views
An undirected graph is Eulerian if and only if all vertices of G are of the sum of the degrees of all nodes is
An undirected graph is Eulerian if and only if all vertices of G are of the sum of the degrees of all nodes isA. Same degreeB. ODD degreeC. Need not be ODDD. ...
User Avatar
1 votes
1 votes
2 answers
2
shivani2010 asked Jun 12, 2016
4,457 views
An undirected graph G has n vertices and n-1 edges then G is
An undirected graph G has n vertices and n-1 edges then G is A. Cyclic B. Addition of edge will make it cyclic C. Eulerian D. Is a Tree
An undirected graph G has n vertices and n-1 edges then G isA. CyclicB. Addition of edge will make it cyclicC. EulerianD. Is a Tree
User Avatar
0 votes
0 votes
0 answers
4
Malusi asked Jan 12
107 views
Consider a weighted undirected graph with positive edge weights and let (u, v) be an [2] edge in the graph. It is known that the shortest path from source vertex r to u has weight 53 and shortest path from r to v has weight 65. Which statement is always true?
Consider a weighted undirected graph with positive edge weights and let (u, v) be an edge in the graph. It is known that the shortest path from source vertex r to u hasw...
User Avatar
Link Copied!