On graphs having a V {minus 45 degree rule} { x } set as an identifying code

19Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We show that every nonstable graph (possibly infinite) with bounded degree admits a set V {minus 45 degree rule} { x } as an identifying code. We know some infinite graphs for which only its vertex set itself is an identifying code, but these graphs have only vertices of infinite degree. © 2006.

Author supplied keywords

Cite

CITATION STYLE

APA

Gravier, S., & Moncel, J. (2007). On graphs having a V {minus 45 degree rule} { x } set as an identifying code. Discrete Mathematics, 307(3–5), 432–434. https://doi.org/10.1016/j.disc.2005.09.035

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free