1-distinguishability of SEC graphs

This letter describes a new scheme to determine the all minimal edge sets of a SEC graph under which the graph becomes 1- distinguishable. The problem has been treated within the framework of switching theory by showing its equivalence to the classical problem of prime implicant covering.