2-EDGE CLOSURE ABSORBING SETS IN A GRAPH
Let be a simple graph without isolated vertices. A set is a 2-edge closure absorbing set in a graph G if for each vertex either v is incident to an edge in D or there exist edges such that and The minimum cardinality of a 2-edge closure absorbing set of G, denoted by is the 2-edge closure absorbing number of G and a 2-edge closure absorbing set with cardinality is called a -set of G. In this paper, the concept of a 2-edge closure absorbing set in a graph is investigated. We determine the bounds of the 2-edge closure absorbing number of some graphs.
graph, geodesic, 2-edge, closure absorbing, independent.