Abstract
In a graph G=(V,E), a subset of vertices C (=code) is called t-identifying if for all v/spl epsiv/V the sets B/sub t/(u)/spl cap/C consisting of all elements of C within distance t from u are nonempty and different. We study some properties of these codes.
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.
