645 views
0 votes
0 votes
A graph with alternating edges and vertices is called  a walk (we can repeat the number of vertices and edges any number of times) .

A walk in which no edges are repeated is called a trial.

A trial in which no vertices are repeated is called a path.

A trial in which only the starting and ending vertices are repeated is called a circuit.

Are the definitions correct??

1 Answer

0 votes
0 votes
Correct just a simple mistake its trail not trial 😂

Related questions

0 votes
0 votes
1 answer
1
Anand67222 asked Oct 14, 2023
302 views
How many simple directed (unweighted) graphs on the set of vertices {v0,v1,…v5} are there that have at most one edge between any pair of vertices? (That is, for two ver...
0 votes
0 votes
1 answer
2
gagan55 asked Jun 30, 2023
177 views
Number of hamiltonian cycles for a graph K 5, 5( bipartite graph ) ??
0 votes
0 votes
2 answers
4
raja11sep asked Jan 5, 2022
464 views
Why is the vertex connectivity of a graph always less than or equal to its edge connectivity?