Identifying codes in line graphs I


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 G, we show that the… (More)


  • Presentations referencing similar topics