초록 열기/닫기 버튼
In 1994, Fellows and Koblitz introduced a public key encryption system using Perfect Dominating Set of regular graph. In this paper, we will present a matrix-based encryption system as a generalized version of this public key encryption system. We will also present an algorithm for constructing d-regular graphs, particularly focusing on methods for constructing regular graphs whose adjacency matrices have an eigenvalue of $-1$. In addition, we have found a necessary and sufficient condition for a graph to have a perfect dominating set and will provide a method for finding it.
