313 views
0 votes
0 votes

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
Çșȇ ʛấẗẻ asked Jul 3, 2023
511 views
Prove that following graph does not have Hamiltonian cycle.
0 votes
0 votes
2 answers
3
amit166 asked Jan 29, 2019
2,635 views
A simple regular graph n vertices and 24 edges, find all possible values of n.
0 votes
0 votes
1 answer
4
iarnav asked Apr 9, 2018
475 views
A connected graph ‘G’ may have at most (n–2) cut vertices.