Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged vertex-cover
0
votes
0
answers
1
UGC NET CSE | October 2022 | Part 1 | Question:: 56
Consider the following statements of approximation algorithm : Statement $\text{I}$: Vertex-cover is a polynomial time $2$-approximation algorithm. Statement $\text{II}$: $\text{TSP}$-tour is a polynomial time $3$-approximation algorithm for ... $\text{II}$ true Statement $\text{I}$ and Statement $\text{II}$ false
admin
asked
in
Others
Oct 23
by
admin
17
views
ugcnetcse-oct2022-paper1
algorithms
vertex-cover
4
votes
2
answers
2
GO Classes Scholarship 2023 | Test | Question: 9
Consider the following graph $\text{G:}$ Let $\text{M, C, I, S, B, E}$ be the Matching number, chromatic number, independence number, Clique number, Vertex cover number, and edge cover number, respectively of $\text{G}.$ What is $\text{M+C+I+S+B+E}?$
GO Classes
asked
in
Graph Theory
Aug 7
by
GO Classes
290
views
goclasses-scholarship-test1
numerical-answers
goclasses
graph-theory
graph-connectivity
vertex-cover
2-marks
3
votes
2
answers
3
CMI2019-A-7
An interschool basketball tournament is being held at the Olympic sports complex. There are multiple basketball courts. Matches are scheduled in parallel, with staggered timings, to ensure that spectators always have some match or other available to watch. Each match ... solve? Find a minimal colouring. Find a minimal spanning tree. Find a minimal cut. Find a minimal vertex cover.
gatecse
asked
in
Graph Theory
Sep 13, 2019
by
gatecse
466
views
cmi2019
graph-theory
graph-coloring
spanning-tree
vertex-cover
descriptive
1
vote
0
answers
4
What to study & from where to study - Graph Theory for GATE 2019.
Are the following topics necessary/ apt to study for gate.(Bold items are explicitly mentioned in gate syllabus document) Connectivity Matching Coloring Cuts Covering Independent Sets Planar Graphs Isomorphism Walks, Trails, Paths, ... taking a lot of time. Can anyone please recommend a reliable and simple resource to go with.
Krishna Sai Vootla
asked
in
Graph Theory
Dec 29, 2018
by
Krishna Sai Vootla
1.4k
views
syllabus
engineering-mathematics
graph-theory
graph-planarity
graph-isomorphism
vertex-cover
1
vote
1
answer
5
EET IITD
Churchill Khangar
asked
in
Graph Theory
Nov 23, 2018
by
Churchill Khangar
392
views
graph-theory
graph-connectivity
vertex-cover
1
vote
1
answer
6
Zeal Test Series 2019: Graph theory - Vertex Cover
is there any easy way to do this i did it by making equation,Mn+Ec=Vn, Vc+In=Vn
Prince Sindhiya
asked
in
Graph Theory
Nov 19, 2018
by
Prince Sindhiya
353
views
zeal
graph-theory
vertex-cover
zeal2019
0
votes
1
answer
7
Discrete mathematics
Deepalitrapti
asked
in
Graph Theory
Oct 17, 2018
by
Deepalitrapti
400
views
vertex-cover
1
vote
0
answers
8
MadeEasy Test Series: Graph Theory - Vertex Cover
Vertex cover = Total vertex - Maximum independent set vertex cover = 8 - 3 = 5. In given answer Covering number is given as 4. I think it is given wrong please verify. Thank you.
Hemant Parihar
asked
in
Graph Theory
Jan 29, 2018
by
Hemant Parihar
350
views
graph-theory
made-easy-test-series
vertex-cover
0
votes
1
answer
9
DISCRETE
The size of minimum vertex cover can be - (A) Smaller than the size of maximum matching (B) No smaller than the size of maximum matching (C) Cannot say
ashutoshsharma
asked
in
Graph Theory
Sep 21, 2017
by
ashutoshsharma
239
views
vertex-cover
1
vote
1
answer
10
discrete
Given a maximum matching M, if we pick one endpoint of each edge in M, this form a valid vertex cover. TRUE FALSE
ashutoshsharma
asked
in
Graph Theory
Sep 21, 2017
by
ashutoshsharma
545
views
vertex-cover
0
votes
1
answer
11
MadeEasy Subject Test: Engineering Mathematics- Graph Connectivity
vaishali jhalani
asked
in
Graph Theory
Jan 20, 2017
by
vaishali jhalani
391
views
made-easy-test-series
discrete-mathematics
graph-theory
vertex-cover
maximum-independent
4
votes
1
answer
12
TIFR CSE 2016 | Part B | Question: 10
A $vertex \: cover$ in an undirected graph $G$ is a subset $ C \subseteq V(G)$ such that every edge of $G$ has an endpoint in $C$. An independent set in $G$ is a subset $I \subseteq V(G)$ such that no edge has both its endpoints in $I$. Which of the ... $\mid C \mid \: \: \geq \: \: \mid V(G)\mid /2$ $C$ intersects every independent set
go_editor
asked
in
Graph Theory
Dec 29, 2016
by
go_editor
484
views
tifr2016
graph-theory
vertex-cover
1
vote
2
answers
13
ISI2011-PCB-CS-3c
A vertex cover of a graph $G = (V, E)$ is a set of vertices $V' \subseteq V$ such that for any edge $(u, v) \in E$, either $u$ or $v$\ (or both) is in $V'$. Write a linear time algorithm to find the minimum vertex cover of a given tree $T$. Establish its correctness.
go_editor
asked
in
Graph Theory
Jun 3, 2016
by
go_editor
359
views
descriptive
isi2011-pcb-cs
graph-theory
vertex-cover
To see more, click for the
full list of questions
or
popular tags
.
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(855)
Recent questions tagged vertex-cover
Recent Blog Comments
Maximum age limit changed from 35 yrs. to 28...
Hmm, sir totally getting your point ☺️☺️....
yes, that's fine. But saying so in a public forum...
@gatecse Sir , I know you are correct. I just...
@Deepanshu I have to disagree there...