Irène Charon scite author profile

Let $G=(V,E)$ be a connected undirected graph and $S$ a subset of vertices. If for all vertices $v \in V$, the sets $B_r(v) \cap S$ are all nonempty and different, where $B_r(v)$ denotes the set of all points within distance $r$ from $v$, then we call $S$ an $r$-identifying code. We give constructive upper bounds on the best possible density of $r$-identifying codes in four infinite regular graphs, for small values of $r$.

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Irène Charon

Identifying and locating-dominating codes on chains and cycles

Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard

Identifying Codes with Small Radius in Some Infinite Regular Graphs

Contact Info

Product

Resources

About