The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Test series
0
votes
60
views
Plz explain ??
asked
Feb 1, 2018
in
Graph Theory
by
Manis
Active
(
1.5k
points)

60
views
answer
comment
0
If possible (detail explanation ).. not directly answer. So that I could understand it clearly and could solve in future..
+1
complete graph of 6 vertices has 15 edges
given graph has 7 edges so complement has 157=8 edges
0
I think u have used :
Sum of degree of all vertices= 2*No of edges
Given: 14=2E , so E=7
For complete graph with six vertices:
6*5=2E , so E =15
Hence no of edges in G complement =157=8...
Thanks .. I got it...
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
0
votes
Degrees are (5,2,2,2,2,1)
take (n1) 61 =5 and subtract from the degree
(0,3,3,3,3,4) this will be degree sequence of complement ..
sum of degrees is 16=2e
so no of edges are 8
answered
Feb 1, 2018
by
Raveena Yadav 1
Junior
(
663
points)
edited
Feb 1, 2018
by
Raveena Yadav 1
comment
0
I have understood this que by some other method , but I didn't understand this. Plz explain little bit more...
Please
log in
or
register
to add a comment.
← Prev. Qn. in Sub.
Next Qn. in Sub. →
← Prev.
Next →
Related questions
+1
vote
1
answer
1
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_{n1}$, 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_____________
asked
May 23, 2019
in
Graph Theory
by
srestha
Veteran
(
119k
points)

157
views
madeeasytestseries
graphtheory
theoryofcomputation
+1
vote
1
answer
2
ACE TEST SERIES QUESTION ON Graph Theory
asked
Jan 24, 2019
in
Graph Theory
by
Shankar Kakde
(
195
points)

65
views
0
votes
1
answer
3
MadeEasy Test Series: Discrete Mathematics  Graph Thoery
The number of labelled subgraphs possible for the graph given below.
asked
Jan 19, 2019
in
Graph Theory
by
snaily16
(
245
points)

344
views
madeeasytestseries
discretemathematics
graphtheory
0
votes
0
answers
4
Ace Test Series: Graph Theory  Cut Edges
If G is a connected simple graph with 10 vertices in which degree of every vertex is 2 then number of cut edges in G is ?
asked
Jan 19, 2019
in
Graph Theory
by
Na462
Loyal
(
7k
points)

98
views
graphtheory
acetestseries
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
ISRO CSE 2020 PAPER ANALYSE
BARC OCES/DGFS 2020
ISI CMI PDF by GATE Overflow
Calculus Important Points
Management Trainee Recruitment COAL INDIA 2020
All categories
General Aptitude
1.9k
Engineering Mathematics
7.5k
Discrete Mathematics
5.2k
Mathematical Logic
2.1k
Set Theory & Algebra
1.4k
Combinatory
916
Graph Theory
824
Probability
1k
Linear Algebra
723
Calculus
592
Digital Logic
2.9k
Programming and DS
4.9k
Algorithms
4.4k
Theory of Computation
6.2k
Compiler Design
2.1k
Operating System
4.5k
Databases
4.1k
CO and Architecture
3.4k
Computer Networks
4.2k
Non GATE
1.4k
Others
1.4k
Admissions
595
Exam Queries
573
Tier 1 Placement Questions
23
Job Queries
72
Projects
18
Follow @csegate
Recent Blog Comments
@nkg_master9  For getting selected for the...
Nowhere it's mentioned.
@bond  Is it mentioned that you have to score at...
I think cutoff won't cross 85
Cut off will be between 95115 not more than that.
50,737
questions
57,384
answers
198,542
comments
105,340
users