2.6.08

The Gossip Problem

Every person has a unique secret.   When two people have a conversation, they share the secrets that they possess.  What is the minimum number of conversations that n people must have so that every person knows every person’s secret?

Use vertex-edge graphs to find your solution.  You are looking for a relationship between the number of conversations and the number of people, not a specific number.

When you have a solution, illustrate it with three different graphs and explain in two written paragraphs.