How Many Substructures Can Be Found in Complete Graphs K_n?

  • Thread starter Thread starter sara15
  • Start date Start date
  • Tags Tags
    Logic
sara15
Messages
14
Reaction score
0
If we have K_n denote the complete graph on n vertices, can anyone explain to me how to know how many substructures does K_n have?
 
Physics news on Phys.org
sara15 said:
If we have K_n denote the complete graph on n vertices, can anyone explain to me how to know how many substructures does K_n have?

Do you mean how many sub graphs does it have? If so, how many subsets of n verticies is there?
 
Robert1986 said:
Do you mean how many sub graphs does it have? If so, how many subsets of n verticies is there?

yes it means a subgraph
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Back
Top