822 views

2 Answers

0 votes
0 votes
It depends.. If it is null graph with 1 vertex then it is both euler and hamiltonian.

But if it is null graph with vertices greater than 1 then it would no longer be connected so it would not be euler also not be hamiltonian.

 

Correct me if i am wrong somewhere
0 votes
0 votes
Yes its always true until we are working with trivial components

Related questions

5 votes
5 votes
2 answers
1
Nidhi Budhraja asked Aug 26, 2018
2,376 views
Stmt 1: A simple graph is necessarily connected if |E| (n-1)*(n-2)/2.Stmt2: A simple graph with n vertices and k components has at least n-k edges.Can you please explain...
2 votes
2 votes
2 answers
2
rahul sharma 5 asked Jun 12, 2017
1,982 views
What are the necessary and sufficient conditions for Euler path and Circuit in directed graph?
0 votes
0 votes
0 answers
4