Register
Dark Mode

#Narsingh_Deo Chapter-2 problem 2-29

in Graph Theory
577 views
1 vote
1 vote

Show that in a dancing ring of n children it is always possible to arrange the children so that everyone has a friend at each side if every child enjoys friendship with at least half the children.

in Graph Theory
by
577 views

2 Comments

by
yes it is possible

and for details proof use induction method
0
0
by
Can you show me detailed explanation
0
0

Please log in or register to answer this question.

← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 vote
1 vote
1 answer
3
ankitgupta.1729 asked in Graph Theory Apr 15, 2018
1,130 views
Narsingh Deo Problem 2-28
ankitgupta.1729 asked in Graph Theory Apr 15, 2018
by ankitgupta.1729
1.1k views

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

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!