closed by
290 views
2 votes
2 votes
closed with the note: Duplicate of https://gateoverflow.in/110367/virtual-gate-graph
A complete graph on n vertices is an undirected graph in which every pair of distinct vertices is connected by an edge. A simple path in a graph is one in which no vertex is repeated. Let G be a complete graph on 10 vertices. Let u, v, w be three distinct vertices in G. How many simple paths are there from u to v going through w?
closed by

Related questions

6 votes
6 votes
3 answers
1
radha gogia asked Nov 28, 2015
4,802 views
Determine the number of paths of length $2$ in the following graphI couldn't get this logic .
0 votes
0 votes
1 answer
2
angel rajput asked Feb 15, 2015
733 views
If I have any complete graph given then what is the approach to be followed up for calculating the number of paths of length n because for large value of n ,computation w...
1 votes
1 votes
1 answer
3
0 votes
0 votes
1 answer
4
gagan55 asked Jun 30, 2023
177 views
Number of hamiltonian cycles for a graph K 5, 5( bipartite graph ) ??