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
GO Classes Test Series 2024 | Discrete Mathematics | Test 5 | Question: 4
GO Classes
asked
in
Graph Theory
May 11, 2022
retagged
May 27, 2023
by
Lakshman Bhaiya
535
views
4
votes
4
votes
The number of simple undirected graphs with $6$ labeled vertices and exactly $3$ edges is _________
goclasses2024-dm-5-weekly-quiz
numerical-answers
goclasses
graph-theory
graph-connectivity
1-mark
GO Classes
asked
in
Graph Theory
May 11, 2022
retagged
May 27, 2023
by
Lakshman Bhaiya
by
GO Classes
535
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
6
votes
6
votes
With $6$ vertices, maximum $^{6}\text{C}_{2} = 15$ edges possible. We need exactly three edges, so, total number of graphs possible is $^{15}\text{C}_{3} = 455.$
GO Classes
answered
May 11, 2022
by
GO Classes
comment
Follow
share this
2 Comments
by
Upendra Paleti
commented
Jan 26, 2023
reply
Follow
share this
Is this is the answer for $ 6 Labelled Vertices$.@sachin
0
0
by
Psy Duck
commented
Feb 17, 2023
reply
Follow
share this
answer should be 2⁴⁵⁵
0
0
Please
log in
or
register
to add a comment.
Answer:
455
← Previous
Next →
← Previous in category
Next in category →
Related questions
5
votes
5
votes
1
answer
1
GO Classes
asked
in
Graph Theory
May 11, 2022
591
views
GO Classes Test Series 2024 | Discrete Mathematics | Test 5 | Question: 6
Let $\text{G = (V, E)}$ be a finite directed acyclic graph with $|\text{E}| > 0.$ Which of the following is not necessarily true? $\text{G}$ has a vertex with no incoming edge. $\text{G}$ has a ... no outgoing edge. $\text{G}$ has an isolated vertex, that is, one with neither an incoming edge nor an outgoing edge. None
GO Classes
asked
in
Graph Theory
May 11, 2022
by
GO Classes
591
views
goclasses2024-dm-5-weekly-quiz
goclasses
graph-theory
graph-connectivity
1-mark
3
votes
3
votes
1
answer
2
GO Classes
asked
in
Graph Theory
May 11, 2022
513
views
GO Classes Test Series 2024 | Discrete Mathematics | Test 5 | Question: 7
A Hamiltonian circuit in a graph is a closed path that visits every vertex in the graph exactly once. A Hamiltonian circuit ends up at the vertex from where it started. If a graph has some Hamiltonian circuit, then the graph is called a ... following is/are a hamiltonian graph? $\text{G1}$ $\text{G2}$ $\text{G3}$ $\text{G4}$
GO Classes
asked
in
Graph Theory
May 11, 2022
by
GO Classes
513
views
goclasses2024-dm-5-weekly-quiz
goclasses
graph-theory
graph-connectivity
multiple-selects
1-mark
4
votes
4
votes
1
answer
3
GO Classes
asked
in
Graph Theory
May 11, 2022
378
views
GO Classes Test Series 2024 | Discrete Mathematics | Test 5 | Question: 8
Let $\text{G}$ be a simple graph where $\text{V(G)} = \{1, 2, \dots , 100\}$ and there is an edge between two distinct vertices $a$ and $b$ iff $a$ divides $b.$ Which of the following statements are true for $\text{G}?$ ... $\text{G}$ is $1.$ $\text{G}$ is connected. The diameter of $\text{G}$ is $6.$
GO Classes
asked
in
Graph Theory
May 11, 2022
by
GO Classes
378
views
goclasses2024-dm-5-weekly-quiz
goclasses
graph-theory
graph-connectivity
multiple-selects
1-mark
4
votes
4
votes
1
answer
4
GO Classes
asked
in
Graph Theory
May 11, 2022
367
views
GO Classes Test Series 2024 | Discrete Mathematics | Test 5 | Question: 11
Let $\text{K}(4,6)$ be the complete bipartite graph on $10$ vertices, having $4$ vertices in one part and having $6$ ... is a complete graph. Either $\text{K}(m,n)$ OR complement of $\text{K}(m,n)$ is dis-connected.
GO Classes
asked
in
Graph Theory
May 11, 2022
by
GO Classes
367
views
goclasses2024-dm-5-weekly-quiz
goclasses
graph-theory
graph-connectivity
multiple-selects
2-marks
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
