Dark Mode

Recent questions tagged graph-theory

0 votes

0 answers

1

GATE 2023 Question no 55
Let G be a simple, finite, undirected graph with vertex set {v1,...,vn}. Let Δ(G) denote the maximum degree of G and let N = {1, 2,...} denote the set of all possible colors. Color the vertices of G using the following greedy strategy: for i ... colors used is equal to the chromatic number of G. Why is option D also not a solution? Gate answer key shows (A,B) as solutions.

varun_kuk asked in Graph Theory Feb 22

21 views

0 votes

0 answers

2

#Graphs #Self_Doubt #Connectivity
What is a biconnected componenet?Does it always include V-V’ where V’ represent the set of articulation points of a graph G?

Gate Shark asked in Graph Theory Feb 17

71 views

4 votes

2 answers

3

GATE CSE 2023 | Question: 45
Let $G$ be a simple, finite, undirected graph with vertex set $\left\{v_{1}, \ldots, v_{n}\right\}$. Let $\Delta(G)$ denote the maximum degree of $G$ and let $\mathbb{N}=\{1,2, \ldots\}$ denote the set of all possible colors. Color the vertices ... $\Delta(G)$. The number of colors used is equal to the chromatic number of $G$.

admin asked in Graph Theory Feb 15

by admin

2.1k views

1 vote

0 answers

4

TestBook graph theory question
If G is a simple planar connected graph with 5 vertices, how many edges in maximum can be there in the given graph?

Sahil_Lather asked in Graph Theory Jan 27

by Sahil_Lather

119 views

0 votes

0 answers

5

TestBook graph theory questions
Let Gn be the complete bipartite graph K13, 17 then the chromatic number of G̅n is _____ (G̅n is complement of Gn and n = 30) A 13 B 17 C n(n−1)2−13×17 D n(n−1)2−2

Sahil_Lather asked in Graph Theory Jan 27

by Sahil_Lather

86 views

0 votes

0 answers

6

TestBook Hasse Diagram question to find GLB
If [P(A); ⊆] is a lattice where A = {x, y} and P(A) is the power set then what is the sum of element in Greatest Lower Bound (GLB) set of given lattice? x + y x y 0

Sahil_Lather asked in Graph Theory Jan 27

by Sahil_Lather

48 views

0 votes

0 answers

7

#selfdoubt
Let n players enter a chess tournament. How many tournament trees are possible? RULES: a player is eliminated after one loss and games are played until only one entrant is left(assume no ties) My approach: (please check if it is correct) there are 3 possible binary tree skeletons w.r.t ... )C2 * (n-4)C2 *...*1} * 2^(n-1) similarly we can do the remaining cases. Is the above method right?

robinofautumn asked in Combinatory Jan 11

by robinofautumn

45 views

3 votes

0 answers

8

graph theory
Let $G=(V,E)$ where $V=\left \{ 1,2,3,4,.....,150\right \}$ and $(u,v) \in E$ if either $(u mod v) =0$ or $(v mod u)=0$.The Chromatic number of G is ?

Kabir5454 asked in Graph Theory Jan 2

167 views

1 vote

1 answer

9

Self Doubt
Does BFS and DFS traversal sequence exist for disconnected graphs? Is yes can you please give a dry run of the algorithm on a disconnected graph? According to me it should not exist as there is no edge to visit certain vertices of a different graph component from the source vertex in a disconnected graph. There is no absolute answer I could find online to this question.

Sunnidhya Roy asked in Algorithms Dec 20, 2022

by Sunnidhya Roy

155 views

1 vote

0 answers

10

DRDO CSE 2022 Paper 1 | Question: 9
Count the number of perfect matchings in the bipartite graph whose adjacency matrix $\text{A}$ is as follows. \[\left[\begin{array}{lll} 1 & 1 & 0 \\ 0 & 1 & 1 \\ 1 & 1 & 1 \end{array}\right]\]

admin asked in Graph Theory Dec 15, 2022

by admin

64 views

1 vote

0 answers

11

DRDO CSE 2022 Paper 1 | Question: 10
Given a tree $\text{T}$ and $\lambda \geq 2$ colours $\left(c_{1}, c_{2}, \ldots, c_{\lambda}\right),$ how many proper colourings of the tree $\text{T}$ are possible?

admin asked in Graph Theory Dec 15, 2022

by admin

73 views

1 vote

0 answers

12

DRDO CSE 2022 Paper 1 | Question: 11
Consider the following graph. Find closeness centrality of $\text{‘A’}$ node.

admin asked in Graph Theory Dec 15, 2022

by admin

70 views

1 vote

0 answers

13

DRDO CSE 2022 Paper 1 | Question: 13
Consider the following graph. Which nodes form the cliques of size $3?$

admin asked in Graph Theory Dec 15, 2022

by admin

62 views

0 votes

1 answer

14

graph theory ,discrete math
how many subgraph with atleast 1 vertex does k2 have? (graph theory question)

shuham kumar asked in Mathematical Logic Nov 18, 2022

by shuham kumar

138 views

0 votes

1 answer

15

mde esy test series
Which of the following statements is/are true? A. In a labelled undirected connected simple graph G, all the depth-first search from same node form same tree. B. In a labelled undirected connected simple graph, G, all the breadth first search from same node form same ... is descendent of u in all possible depth-first search forest of G. (u.d is discover time of node u in DFS).

Himanshu555 asked in Algorithms Nov 8, 2022

176 views

–4 votes

2 answers

16

Data Structure- Tree & Graphs
*MSQ* The following figure depicts a a. A tree and only tree b. A tree with 3 nodes c. A graph (Since every tree is a graph) d. A graph and only graph

Souvik33 asked in Programming Oct 27, 2022

228 views

Page:

1
2
3
4
5
6
...
27
next »

Recent questions tagged graph-theory