Register

graph theory

1,307 views

2 Answers

0 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
Voting & Accepting an answer helps improve the community
← Previous · Kenneth Rosen Editio...Next → · algorithm
← Previous in category · algorithmNext in category → · Generating Functions...
Position:
Show:

Related questions

5 5 votes
2 answers 2 answers
3.8k
3.8k views
Nidhi Budhraja asked Aug 26, 2018
3,825 views
Graph theory
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 2 votes
2 2 answers
2.7k
2.7k views
rahul sharma 5 asked Jun 12, 2017
2,747 views
Discrete Maths Graph theory
What are the necessary and sufficient conditions for Euler path and Circuit in directed graph?
1 1 vote
3 3 answers
668
668 views
GO Classes asked Jun 9, 2025
668 views
GO Classes DPP | Graph Theory | Graph Connectivity | University of California, Berkeley
 How many of the following given set of vertices is/are CORRECT strongly connected components for the given directed graph?$C$$A$$E$$IC$$F$$IDE$$I$$H$$GJ$
0 0 votes
0 0 answers
499
499 views
Misbah Ghaya asked Aug 14, 2022
499 views
Best Open Video Playlist for Graph Theory: Connectivity Topic | Discrete Mathematics
Please list out the best free available video playlist for Graph Theory: Connectivity Topic from Discrete Mathematics as an answer here (only one playlist per answer). We...