1,132 views
0 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?

1 Answer

Position:
Show:

Related questions

0 0 votes
0 0 answers
1.4k
1.4k views
Winner asked Mar 4, 2019
1,445 views
What is meant by edge disjoint hamiltonian circuits in a graph
0 0 votes
0 0 answers
737
737 views
Ayush Upadhyaya asked Jun 8, 2018
737 views
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.
0 0 votes
0 0 answers
623
623 views
Ayush Upadhyaya asked Jun 8, 2018
623 views
Show that a graph G is non-separable iff every vertex pair can be placed in some circuit in G.
1 1 vote
2 answers 2 answers
2.2k
2.2k views
Ayush Upadhyaya asked Jun 2, 2018
2,178 views
Is every regular graph of degree d(d$\geq$3) non-separable?If not, give a simple regular graph of degree 3 that is separable.