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
Made Easy Mock Test 2
Rohit Chakraborty
asked
in
Mathematical Logic
Jan 11
226
views
0
votes
0
votes
graph-theory
made-easy-test-series
engineering-mathematics
Rohit Chakraborty
asked
in
Mathematical Logic
Jan 11
by
Rohit Chakraborty
226
views
answer
comment
Follow
share this
share
2 Comments
by
Hira Thakur
commented
Jan 11
reply
Follow
share this
ref:
GATE CSE 2022 | Question: 20
1
1
by
꧁༒☬ĿọŗԀ 🆂🅷🅸🆅🅰☬༒꧂
commented
Jan 11
reply
Follow
share this
this question is asking for maximum edges in $k_{19}$ graph
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
0
answers
1
Anusha Motamarri
asked
in
Graph Theory
Dec 8, 2016
857
views
MadeEasy Test Series: Graph Theory - Graph Connectivity
if m=4 and n=6 (complete graph) option B says removal of mC2-n+2 = 6-6+2=2 edges. but it needs 3 edges to make the graph disconnected. how B is answer?
Anusha Motamarri
asked
in
Graph Theory
Dec 8, 2016
by
Anusha Motamarri
857
views
made-easy-test-series
engineering-mathematics
discrete-mathematics
graph-theory
graph-connectivity
1
vote
1
vote
0
answers
2
tishhaagrawal
asked
in
Graph Theory
Dec 16, 2023
519
views
Made Easy: Counting number of subgraphs of the given graph. How should I approach this question?
tishhaagrawal
asked
in
Graph Theory
Dec 16, 2023
by
tishhaagrawal
519
views
gate-preparation
test-series
made-easy-test-series
self-doubt
counting
graph-theory
discrete-mathematics
graph-connectivity
0
votes
0
votes
0
answers
3
Ray Tomlinson
asked
in
Algorithms
Aug 9, 2023
510
views
Made Easy Test Series 2024
Suppose we have a directed graph G = (V,E) with V= {1, 2, ..., n} and Eis presented as an adjacency list. For each vertex u in V, out(u) is a list such that (u, v) in {1, 2, ... k). For each u in V, we wish to compute a corresponding list in(u) =such that in E ... take to construct the lists in(u), u in V, from the lists out(u), u in V? T(n) =O(n+m) B. T(n)= O(n(m+n))
Ray Tomlinson
asked
in
Algorithms
Aug 9, 2023
by
Ray Tomlinson
510
views
made-easy-test-series
algorithms
made-easy-booklet
algorithm-design
time-complexity
linked-list
graph-theory
graph-algorithm
2
votes
2
votes
3
answers
4
srestha
asked
in
Graph Theory
May 23, 2019
951
views
Made easy Test Series:Graph Theory+Automata
Consider a graph $G$ with $2^{n}$ vertices where the level of each vertex is a $n$ bit binary string represented as $a_{0},a_{1},a_{2},.............,a_{n-1}$, where each $a_{i}$ is $0$ or $1$ ... and $y$ denote the degree of a vertex $G$ and number of connected component of $G$ for $n=8.$ The value of $x+10y$ is_____________
srestha
asked
in
Graph Theory
May 23, 2019
by
srestha
951
views
made-easy-test-series
graph-theory
theory-of-computation
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Discrete Mathematics
(7.1k)
Mathematical Logic
(2.5k)
Set Theory & Algebra
(1.9k)
Combinatory
(1.6k)
Graph Theory
(1.1k)
Probability
(1.4k)
Linear Algebra
(1.1k)
Calculus
(792)
Optimization
(0)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy