Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage for Graph Theory:
Recent questions tagged graph-theory
0
votes
1
answer
1
ISI kolkata MTech CS 2019
Let $K_n$ denote the complete graph on $n$ vertices, with $n ≥ 3$, and let $u$, $v$, $w$ be three distinct vertices of $K_n$. Determine the number of distinct paths from $u$ to $v$ that do not contain the vertex $w$.
Let $K_n$ denote the complete graph on $n$ vertices, with $n ≥ 3$, and let $u$, $v$, $w$ be three distinct vertices of $K_n$. Determine the number of distinct paths fro...
suvasish114
64
views
suvasish114
asked
Apr 16
Graph Theory
graph-theory
combinatory
isi2019-pcb-cs
+
–
0
votes
1
answer
2
Practice Material Question
If G is a connected graph with 6 vertices and maximum number of edges, then which of the following is true ? (a) Euler path exists, but Euler circuit does not exist in G. (b) Only Euler path exists in G. (c) Euler circuit does not exists in G (d) G is not traversable.
If G is a connected graph with 6 vertices and maximum number of edges, then which of the following is true ? (a) Euler path exists, but Euler circuit does not exist in G....
Akash Chakraborty
108
views
Akash Chakraborty
asked
Mar 30
Graph Theory
gate-preparation
graph-theory
+
–
0
votes
1
answer
3
#algorithm
how many spanning trees are possible for complete graph of 4 vertices
how many spanning trees are possible for complete graph of 4 vertices
Amoljadhav
138
views
Amoljadhav
asked
Mar 1
Algorithms
algorithms
data-structures
graph-theory
+
–
2
votes
2
answers
4
GATE CSE 2024 | Set 2 | Question: 7
Let $\text{A}$ be the adjacency matrix of a simple undirected graph $\text{G}$. Suppose $\text{A}$ is its own inverse. Which one of the following statements is always TRUE? $\text{G}$ is a cycle $\text{G}$ is a perfect matching $\text{G}$ is a complete graph There is no such graph $\text{G}$
Let $\text{A}$ be the adjacency matrix of a simple undirected graph $\text{G}$. Suppose $\text{A}$ is its own inverse. Which one of the following statements i...
Arjun
2.9k
views
Arjun
asked
Feb 16
Graph Theory
gatecse2024-set2
graph-theory
+
–
1
votes
3
answers
5
GATE CSE 2024 | Set 2 | Question: 50
The chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. The chromatic number of the following graph is __________.
The chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. The chromatic number of the following graph is __________.
Arjun
1.9k
views
Arjun
asked
Feb 16
Graph Theory
gatecse2024-set2
graph-theory
numerical-answers
graph-coloring
+
–
0
votes
1
answer
6
GATE CSE 2024 | Set 1 | Question: 41
The chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. Let $G$ be any graph with $n$ vertices and chromatic number $k$. Which of the following statements is/are always TRUE? $G$ contains a complete subgraph with ... $n/k$ $G$ contains at least $k(k-1) / 2$ edges $G$ contains a vertex of degree at least $k$
The chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. Let $G$ be any graph with $n$ vertices and chromatic nu...
Arjun
2.1k
views
Arjun
asked
Feb 16
Graph Theory
gatecse2024-set1
multiple-selects
graph-theory
+
–
13
votes
1
answer
7
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 15
Let $\mathrm{G}$ be a simple undirected graph on 8 vertices such that there is a vertex of degree 1 , a vertex of degree 2 , a vertex of degree 3 , a vertex of degree 4, a vertex of degree 5 , a vertex of degree 6 and ... of degree 7. Which of the following can be the degree of the last vertex? (Select all that are possible) 0 3 4 8
Let $\mathrm{G}$ be a simple undirected graph on 8 vertices such that there is a vertex of degree 1 , a vertex of degree 2 , a vertex of degree 3 , a vertex of degree 4, ...
GO Classes
667
views
GO Classes
asked
Feb 5
Graph Theory
goclasses2024-mockgate-14
graph-theory
degree-of-graph
multiple-selects
1-mark
+
–
6
votes
1
answer
8
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 57
A strongly connected component $(\mathrm{SCC})$ of a directed graph $\mathrm{G}=(\mathrm{V}, \mathrm{E})$ ... ; edges in its associated directed acyclic graph $G^{\prime}$ be $A, B$ respectively, then what is $A+B?$
A strongly connected component $(\mathrm{SCC})$ of a directed graph $\mathrm{G}=(\mathrm{V}, \mathrm{E})$ is a maximal set of vertices such that any two vertices in the s...
GO Classes
564
views
GO Classes
asked
Feb 5
Graph Theory
goclasses2024-mockgate-14
numerical-answers
graph-theory
graph-connectivity
2-marks
+
–
1
votes
0
answers
9
Memory Based GATE DA 2024 | Question: 64
Minimum Number of colors in concentric circles.
Minimum Number of colors in concentric circles.
GO Classes
143
views
GO Classes
asked
Feb 4
Graph Theory
gate2024-da-memory-based
goclasses
graph-theory
graph-coloring
+
–
3
votes
1
answer
10
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 63
For an undirected graph $G$, let $\overline{G}$ refer to the complement (a graph on the same vertex set as $G$, with $(i, j)$ as an edge in $\overline{G}$ if and only if it is not an edge in $G$ ). Consider the following ... is equivalent to (iii) and (v). (i) is equivalent to (ii) and (iv). (i) is equivalent to (ii) and (v)
For an undirected graph $G$, let $\overline{G}$ refer to the complement (a graph on the same vertex set as $G$, with $(i, j)$ as an edge in $\overline{G}$ if and only if ...
GO Classes
453
views
GO Classes
asked
Jan 28
Graph Theory
goclasses2024-mockgate-13
goclasses
graph-theory
vertex-cover
2-marks
+
–
4
votes
1
answer
11
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 46
Assume the following graph is a labeled graph i.e. every vertex has a unique label. In how many ways can we color the following labeled graph $\mathrm{G}$ with six colors $\{R, G, B, W, Y, M\}$ such that no two adjacent vertices are assigned the same color?
Assume the following graph is a labeled graph i.e. every vertex has a unique label.In how many ways can we color the following labeled graph $\mathrm{G}$ with six colors ...
GO Classes
658
views
GO Classes
asked
Jan 21
Graph Theory
goclasses2024-mockgate-12
goclasses
numerical-answers
graph-theory
graph-coloring
2-marks
+
–
3
votes
1
answer
12
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 11
The figure above shows an undirected graph with six vertices. Enough edges are to be deleted from the graph in order to leave a spanning tree, which is a connected subgraph having the same six vertices and no cycles. How many edges must be deleted?
The figure above shows an undirected graph with six vertices. Enough edges are to be deleted from the graph in order to leave a spanning tree, which is a connected subgra...
GO Classes
455
views
GO Classes
asked
Jan 13
Graph Theory
goclasses2024-mockgate-11
goclasses
numerical-answers
graph-theory
1-mark
+
–
0
votes
1
answer
13
Made Easy Mock Test 2
Rohit Chakraborty
273
views
Rohit Chakraborty
asked
Jan 11
Mathematical Logic
graph-theory
made-easy-test-series
engineering-mathematics
+
–
0
votes
1
answer
14
ISRO 2024
Maximum number of Simple graphs possible with $n$ vertices $2^{n(n-1)/2}$ $2^{(n-1)/2}$ $2^{n(n+1)/2}$ $2^{n(n+1)}$
Maximum number of Simple graphs possible with $n$ vertices$2^{n(n-1)/2}$$2^{(n-1)/2}$$2^{n(n+1)/2}$$2^{n(n+1)}$
Ramayya
190
views
Ramayya
asked
Jan 7
Graph Theory
isro-2024
graph-theory
discrete-mathematics
+
–
0
votes
1
answer
15
ISRO 2024
If there are five faces and nine vertices in an undirected planar graph, then number of edges is 14 6 12 None of the above
If there are five faces and nine vertices in an undirected planar graph, then number of edges is14612None of the above
Ramayya
295
views
Ramayya
asked
Jan 7
Graph Theory
isro-2024
graph-theory
graph-planarity
+
–
0
votes
2
answers
16
ISRO 2024
Which of the following are true? In a graph G with ‘n’ vertices and ‘e’ edges, sum of degrees of vertices = 2*e. Eccentricity of a connected graph can never be equal to radius of the graph Girth of a graph is the shortest cycle of the graph Graph with equal degree for all vertices is multigraph (i), (ii), (iii) (ii), (iii), (iv) (i), (iii), (iv) None of the above
Which of the following are true?In a graph G with ‘n’ vertices and ‘e’ edges, sum of degrees of vertices = 2*e.Eccentricity of a connected graph...
Ramayya
453
views
Ramayya
asked
Jan 7
Graph Theory
isro-2024
discrete-mathematics
graph-theory
+
–
0
votes
0
answers
17
Which study material to refer to so that one can solve the theory questions on Graphs topic asked in PYQs
I have not been able to answer many of the Graph theory questions, I feel my comprehension of the topic is inadequate, could someone guide me to some reference material I...
DhruvaKashyap
193
views
DhruvaKashyap
asked
Dec 29, 2023
Study Resources
study-resources
gate-preparation
graph-theory
+
–
1
votes
0
answers
18
Made Easy: Counting number of subgraphs of the given graph. How should I approach this question?
tishhaagrawal
544
views
tishhaagrawal
asked
Dec 16, 2023
Graph Theory
gate-preparation
test-series
made-easy-test-series
self-doubt
counting
graph-theory
discrete-mathematics
graph-connectivity
+
–
0
votes
0
answers
19
Find the MIS and MaxIS
Dknights
140
views
Dknights
asked
Dec 14, 2023
Graph Theory
graph-theory
+
–
0
votes
1
answer
20
#self doubt
Domination set and MIS are the same?
Domination set and MIS are the same?
Dknights
128
views
Dknights
asked
Dec 12, 2023
Graph Theory
graph-theory
+
–
0
votes
1
answer
21
Regular and complete graph
which of the following statements is true: a complete graph is $(N-1)$ regular a $(N-1)$ regular is a complete graph
which of the following statements is true:a complete graph is $(N-1)$ regulara $(N-1)$ regular is a complete graph
Dknights
422
views
Dknights
asked
Dec 12, 2023
Graph Theory
graph-theory
+
–
0
votes
0
answers
22
#self_doubt#pyq#graphtheory
Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to the answer is 45 but for the following cases, what will be the answer? 1- if the graph is directed 2- if vertices are not labeled.
Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal tothe answer is 45 but for ...
Dknights
201
views
Dknights
asked
Nov 13, 2023
Graph Theory
graph-theory
+
–
0
votes
1
answer
23
#applied course
how many regions are in the above graph and please explain with region formula also. r=e-v+(c+1) my attempt is : r=5-5+2 r=2 but the rule is twice the no of boundary edges which is (5*2) = sum of region degrees which (4+5=9 ) can someone explain where the fault is
how many regions are in the above graph and please explain with region formula also.r=e-v+(c+1)my attempt is :r=5-5+2r=2but the rule is twice the no of boundary edges whi...
Dknights
256
views
Dknights
asked
Nov 9, 2023
Graph Theory
graph-theory
+
–
0
votes
1
answer
24
made easy test series
Suppose A is a 12 by 9 incidence matrix from a connected (but unknown) graph with 9 nodes and 12 edges. The diagonal entries of $A^{T}.A$ give the number of edges into each node. Then, what is the sum of those diagonal entries ________.
Suppose A is a 12 by 9 incidence matrix from a connected (but unknown) graph with 9 nodes and 12 edges. The diagonal entries of $A^{T}.A$give the number of edges into eac...
jugnu1337
353
views
jugnu1337
asked
Oct 22, 2023
Programming in C
graph-theory
+
–
0
votes
1
answer
25
Self doubt
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 vertices a, b, only at most one of the edges (a, b) and (b, a) is in the graph.)
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...
Anand67222
328
views
Anand67222
asked
Oct 14, 2023
Graph Theory
self-doubt
graph-theory
discrete-mathematics
+
–
1
votes
1
answer
26
Graph Theory
suryansh rajput
204
views
suryansh rajput
asked
Oct 2, 2023
Graph Theory
graph-theory
discrete-mathematics
graph-coloring
+
–
0
votes
2
answers
27
Bipartite Graph doubt
Çșȇ ʛấẗẻ
259
views
Çșȇ ʛấẗẻ
asked
Aug 29, 2023
Graph Theory
graph-theory
discrete-mathematics
bipartite-graph
+
–
Page:
1
2
3
4
5
6
...
30
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register