*Head, Department of Mathematics, Srimad Andavan Arts & Science College, Trichy, Tamilnadu, India, E-mail: andavanmathsramesh@gmail.com
**Asst. Professor, Kongunadu College of Engineering and Technology, Tholurpatti, Thottiam, Tamilnadu, India, kavipraba18@gmail.com
Online published on 18 April, 2018.
This paper considers the stable set of hypergraphs and presents several new results and algorithms using the semi-tensor product of matrices. By the definitions of an incidence matrix of a hypergraph and characteristic logical vector of a vertex subset, an equivalent algebraic condition is established for hypergraph stable sets, as well as a new algorithm, which can be used to search all the stable sets of any hypergraph.
