A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
The induced subgraph of a unit graph with vertex set as the idempotent elements of a ring R is a graph which is obtained by deleting all non idempotent elements of R. Let C be a subset of the vertex set in a graph Γ. Then C is called a perfect code if for any x, y ∈ C the union of the closed neighbourhoods of x and y gives the the vertex set and the intersection of the closed neighbourhoods of x and y gives the empty set. In this paper, the perfect codes in induced subgraphs of the unit graphsdoi:10.37394/23206.2021.20.41 fatcat:eliot2vfa5cxrlmox64lgwabfy