Incidence dimension and 2-packing number in graphs

Abstract

Abstract. Let G = (V,E) be a graph. A set of vertices A is an incidence generator for G if for any two distinct edges e,f ∈ E(G) there exists a vertex from A which is an endpoint of either e or f. The smallest cardinality of an incidence generator for G is called the incidence dimension and is denoted by dimI(G). A set of vertices P ⊆ V (G) is a 2-packing of G if the distance in G between any pair of distinct vertices from P is larger than two. The largest cardinality of a 2-packing of G is the packing number of G and is denoted by ρ(G). In this article, the incidence dimension is introduced and studied. The given results show a close relationship between dimI(G) and ρ(G). We rst note that the complement of any 2-packing in graph G is an incidence generator for G, and further show that either dimI(G) = ρ(G) or dimI(G) = ρ(G)−1 for any graph G. In addition, we present some bounds for dimI(G) and prove that the problem of determining the incidence dimension of a graph is NP-hard.