Abstract
An identifying code of a graph is a subset of vertices C such that the sets B ( v )∩ C are all nonempty and different. In this paper, we investigate the problem of finding identifying codes of minimum cardinality in strips and finite grids. We first give exact values for the strips of height 1 and 2, then we give general bounds for strips and finite grids. Finally, we give a sublinear algorithm which finds the minimum cardinality of an identifying code in a restricted class of graphs which includes the grid.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
