• edited by
3,800 views

1 Answer

Answer:
Position:
Show:

Related questions

10 10 votes
3 3 answers
4.6k
4.6k views
go_editor asked Jun 15, 2016
4,557 views
A simple graph ( a graph without parallel edge or loops) with $n$ vertices and $k$ components can have at most$n$ edges$n-k$ edges$(n-k) (n-k+1)$ edges$(n-k) (n-k+1)/2$ e...
7 7 votes
3 answers 3 answers
7.0k
7.0k views
go_editor asked Jun 15, 2016
7,007 views
In a graph $\text{G}$ there is one and only one path between every pair of vertices then $\text{G}$ is aPathWalkTreeCircuit
9 9 votes
2 answers 2 answers
10.4k
10.4k views
go_editor asked Jun 15, 2016
10,358 views
A graph in which all nodes are of equal degree, is known asMultigraphNon regular graphRegular graphComplete graph
73 73 votes
8 answers 8 answers
18.7k
18.7k views
gatecse asked Sep 15, 2014
18,689 views
Which one of the following is TRUE for any simple connected undirected graph with more than $2$ vertices? No two vertices have the same degree. At least two vertices ...