How many vertices and edges are there in $K_{i,j}$ and $K_{i,j,k}$?
How to find the number of vertices and edges in these graphs?
-2
$\begingroup$
graph-theory
-
0[Wikipedia is a useful resource](http://en.wikipedia.org/wiki/Complete_bipartite_graph) – 2012-06-05
1 Answers
1
$K_{i,j}$ is defined as having a group of $i$ vertices and a group of $j$ vertices, with each vertex of the first group connected to each vertex of the second group, and no edges within a group. Is that your definition? If so, there are $i+j$ vertices (just count the two groups) and $ij$ edges as you pick one of the $i$ and one of the $j$ for each edge. How do you define Kijk (is it $K_{i,j,k}$)? If it is similar but with three groups of vertices, the same counting technique will work.
-
2@mehtapkarabacak: if you don't know the definition, there is no way to answer the question. Do you understand the answer for $K_{i,j}$? The Wikipedia page that TMM cites gives a couple pictures that should help. – 2012-06-05