For any non-empty set and k-subset , the k-intersection graph denoted by m(; ) is undirected simple graph whose vertices are all m-subsets of and two distinct vertices A and B are adjacent if and only if A \ B * . In this paper, we determine diameter, girth, some numerical invariants and planarity, hamiltonian and perfect matching of these graphs. Moreover adjacency matrix is considered at the end.