Register

Search results for graph-theory+engineering-mathematics

33 votes
14 answers
1
GATE CSE 2019 | Question: 12
Let $G$ be an undirected complete graph on $n$ vertices, where $n > 2$. Then, the number of different Hamiltonian cycles in $G$ is equal to $n!$ $(n-1)!$ $1$ $\frac{(n-1)!}{2}$
Let $G$ be an undirected complete graph on $n$ vertices, where $n 2$. Then, the number of different Hamiltonian cycles in $G$ is equal to$n!$$(n-1)!$$1$$\frac{(n-1)!}{2}...
User Avatar
1 votes
3 answers
5
Graph theory | Graph Theory
A simple non directed graph contains $21$ edges, $3$ vertices of degree $4$ and the other vertices are of degree $2$.Then the number of vertices in the graph is? $8$ $13$ $18$ $21$
A simple non directed graph contains $21$ edges, $3$ vertices of degree $4$ and the other vertices are of degree $2$.Then the number of vertices in the graph is?$8$$13$$1...
User Avatar
0 votes
2 answers
6
Ace workbook: If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____
If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____1n-1⌊n/2⌋⌈n/2⌉
User Avatar
1 votes
3 answers
7
TIFR CSE 2020 | Part B | Question: 11
Which of the following graphs are bipartite? Only $(1)$ Only $(2)$ Only $(2)$ and $(3)$ None of $(1),(2),(3)$ All of $(1),(2),(3)$
Which of the following graphs are bipartite?Only $(1)$Only $(2)$Only $(2)$ and $(3)$None of $(1),(2),(3)$All of $(1),(2),(3)$
User Avatar
0 votes
0 answers
13
simple graph formula
why in this planar graph this theorem ,”sum of degrees of faces or regions is twice the number of edges” is not true as it should hold for all planar graphs?? Note: numbers denote region or face
why in this planar graph this theorem ,”sum of degrees of faces or regions is twice the number of edges” is not true as it should hold for all planar graphs??Note: nu...
User Avatar
0 votes
0 answers
14
Eulerian circuit
How many Eulerian graphs are possible?
How many Eulerian graphs are possible?
User Avatar
0 votes
1 answer
17
Complete Graph
Consider the following graph: Number of the Hamiltonian cycles starting and ending point at $ A$ is _______
Consider the following graph:Number of the Hamiltonian cycles starting and ending point at $ A$ is _______
User Avatar
1 votes
1 answer
18
Degree Sequence
$<2, 2, 2, 1, 1>$ degree sequence is NOT graphic for simple graphs$?$
$<2, 2, 2, 1, 1>$ degree sequence is NOT graphic for simple graphs$?$
User Avatar
1 votes
1 answer
20
ISI2017-PCB-CS-1(b)
Show that if the edge set of the graph $G(V,E)$ with $n$ nodes can be partitioned into $2$ trees, then there is at least one vertex of degree less than $4$ in $G$.
Show that if the edge set of the graph $G(V,E)$ with $n$ nodes can be partitioned into $2$ trees, then there is at least one vertex of degree less than $4$ in $G$.
User Avatar
Page: