Create and explore imaginative 3D worlds with our new product Dreamfield (opens in a new tab)
Papers
Topics
Authors
Recent
Search
2000 character limit reached

Identifying codes in line graphs

Published 1 Jul 2011 in math.CO and cs.DM | (1107.0207v2)

Abstract: An identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its neighbours within the code. We study the edge-identifying code problem, i.e. the identifying code problem in line graphs. If $\ID(G)$ denotes the size of a minimum identifying code of an identifiable graph GG, we show that the usual bound $\ID(G)\ge \lceil\log_2(n+1)\rceil$, where nn denotes the order of GG, can be improved to Θ(n)\Theta(\sqrt{n}) in the class of line graphs. Moreover, this bound is tight. We also prove that the upper bound $\ID(\mathcal{L}(G))\leq 2|V(G)|-5$, where L(G)\mathcal{L}(G) is the line graph of GG, holds (with two exceptions). This implies that a conjecture of R. Klasing, A. Kosowski, A. Raspaud and the first author holds for a subclass of line graphs. Finally, we show that the edge-identifying code problem is NP-complete, even for the class of planar bipartite graphs of maximum degree~3 and arbitrarily large girth.

Citations (53)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.