Research Information System
Graphs and Linear Algebra, vol.2024, no.2, pp.1-10, 2024 (Scopus)
Domination and connectivity are two independent subjects of graph theory which have many applications in computer and information sciences. To bring these two terms together, we first define a novel conditional connectivity measure:-domination edge connectivity. Let = (,) be a connected graph and is the edge set of. If − is disconnected and every disconnected component has domination number equals , then minimum cardinality of the set is called-domination edge connectivity number of and denoted as () (). In this study we compute 2-domination edge connectivity of paths, cycles and complete graphs.