This paper proposes a new knowledge discovery method called FLMin to discover frequent patterns in a social network. The algorithm works without previous knowledge on the network and exploits both the structure and the attributes of nodes to extract regularities called Frequent Links. Unlike traditional works in this area that solely exploit structural regularities of the network, the originality of FLMin is its ability to gather these two kinds of information in the search for patterns. In this paper, we detail the method proposed for extracting frequent links and discuss its complexity and its flexibility. The efficiency of our solution is evaluated by conducting qualitative and quantitative studies for understanding how behaves FLMin according to different parameters.