Identifying Vertex Covers in Graphs

Abstract

An identifying vertex cover in a graph G is a subset T of vertices in G that has a nonempty intersection with every edge of G such that T distinguishes the edges, that is, e∩T 6= ∅ for every edge e in G and e∩T 6= f ∩T for every two distinct edges e and f in G. The identifying vertex cover number τD(G) of G is the minimum size of an identifying vertex cover… (More)

Topics

  • Presentations referencing similar topics