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
narsingh deo
Learner_jai
asked
in
Graph Theory
Feb 27, 2017
408
views
0
votes
0
votes
In a village there are equal no of boys and girls of marriageable age.Each boy dates a certain no. of girls and each girl dates a certain number of boys,under what condition is it possible that every girl and boy gets married to one of their dates?
perfect
graph-matching
Learner_jai
asked
in
Graph Theory
Feb 27, 2017
by
Learner_jai
408
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
0
votes
0
votes
Assume there are n boys and n girls, each boy and girl is dating k persons so ans is (k/n)^n
shayal chhabra
answered
Feb 27, 2017
by
shayal chhabra
comment
Follow
share this
1 comment
by
Akriti sood
commented
Feb 27, 2017
reply
Follow
share this
can u pls expalin..how??
0
0
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
1
answer
1
Manu Madhavan
asked
in
Graph Theory
Nov 15, 2016
213
views
Doubt Perfext Matching
Finda a graph with every vertex degree at least 2, and have only one perfext matching. (In Perfect matching all vertex are matched.)
Manu Madhavan
asked
in
Graph Theory
Nov 15, 2016
by
Manu Madhavan
213
views
perfect
perfect-matching
0
votes
0
votes
0
answers
2
Winner
asked
in
Graph Theory
Mar 5, 2019
436
views
Narsingh deo
What is meant by edge disjoint hamiltonian circuits in a graph
Winner
asked
in
Graph Theory
Mar 5, 2019
by
Winner
436
views
graph-theory
0
votes
0
votes
0
answers
3
Ayush Upadhyaya
asked
in
Graph Theory
Jun 8, 2018
261
views
[4-14]Connectivity- Narsingh Deo
Show that a simple graph is nonseparable iff for any two given arbitrary edges a circuit can always be found that will include these two edges.
Ayush Upadhyaya
asked
in
Graph Theory
Jun 8, 2018
by
Ayush Upadhyaya
261
views
graph-theory
narsinghdeo
0
votes
0
votes
0
answers
4
Ayush Upadhyaya
asked
in
Graph Theory
Jun 8, 2018
344
views
[4-13]Connectivity-Narsingh Deo
Show that a graph G is non-separable iff every vertex pair can be placed in some circuit in G.
Ayush Upadhyaya
asked
in
Graph Theory
Jun 8, 2018
by
Ayush Upadhyaya
344
views
graph-theory
narsinghdeo
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)
Discrete Mathematics
(6.4k)
Mathematical Logic
(2.2k)
Set Theory & Algebra
(1.7k)
Combinatory
(1.5k)
Graph Theory
(976)
Probability
(1.2k)
Linear Algebra
(870)
Calculus
(702)
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
(854)
Recent Blog Comments
Please upload 4th Mock Test, due date was 4th Dec.
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
Maximum age limit changed from 35 yrs. to 28...
Hmm, sir totally getting your point ☺️☺️....
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy