1 paper
Ankan Shaw, Biswajit Mondal, Satya Bagchi
A perfect code in a graph I^=(V,E) is a subset C of V such that no two vertices in C are adjacent, and every vertex in V∖C is adjacent to exactly one vertex i…