A mixed dominating set is a collection of vertices and edges that dominates all graph. We study the complexity exact parameterized algorithms for \textsc{Mixed Dominating Set}, resolving some open questions. In particular, we settle problem's by treewidth pathwidth giving an algorithm running in time $O^*(5^{tw})$ (improving current best $O^*(6^{tw})$), as well lower bound showing our cannot be...

A subset X of edges in a graph G is called an edge dominating set of G if every edge not in X is adjacent to some edge in X. The edge domination number γ′(G) of G is the minimum cardinality taken over all edge dominating sets of G. Let m,n and k be positive integers with n − 1 ≤ m ≤ (n 2 ) , G(m,n) be the set of all non-isomorphic connected graphs of order n and size m, and G(m,n; k) = {G ∈ G(m...

A subset X of edges of a graph G is called an edge dominating set of G if every edge not in X is adjacent to some edge in X . The edge domination number γ′(G) of G is the minimum cardinality taken over all edge dominating sets of G. An edge Roman dominating function of a graph G is a function f : E(G) → {0, 1, 2} such that every edge e with f(e) = 0 is adjacent to some edge e′ with f(e′) = 2. T...

in this paper, we define the notions of fuzzy congruence relations and fuzzy convex subalgebras on a commutative residuated lattice and we obtain some related results. in particular, we will show that there exists a one to one correspondence between the set of all fuzzy congruence relations and the set of all fuzzy convex subalgebras on a commutative residuated lattice. then we study fuzzy...

In this paper, we study both concepts of geodetic dominatingand edge geodetic dominating sets and derive some tight upper bounds onthe edge geodetic and the edge geodetic domination numbers. We also obtainattainable upper bounds on the maximum number of elements in a partitionof a vertex set of a connected graph into geodetic sets, edge geodetic sets,geodetic domin...

This paper is devoted to the online dominating set problem and its variants on trees, bipartite, bounded-degree, planar, and general graphs, distinguishing between connected and not necessarily connected graphs. We believe this paper represents the first systematic study of the effect of two limitations of online algorithms: making irrevocable decisions while not knowing the future, and being i...

In this paper we study cooperative cost games arising from domination problems on graphs. We introduce three games to model the cost allocation problem and we derive a necessary and sufficient condition for the balancedness of all three games. Furthermore we study concavity of these games.

We study the approximability of the weighted edge-dominating set problem. Although even the unweighted case is NP-Complete, in this case a solution of size at most twice the minimum can be efficiently computed due to its close relationship with minimum maximal matching; however, in the weighted case such a nice relationship is not known to exist. In this paper, after showing that weighted edge ...

We first obtain some properties of a fundamentally nonexpansive self-mapping on a nonempty subset of a Banach space and next show that if the Banach space is having the Opial condition, then the fixed points set of such a mapping with the convex range is nonempty. In particular, we establish that if the Banach space is uniformly convex, and the range of such a mapping is bounded, closed and con...

The distance dG(u, v) between two vertices u and v in a connected graph G is the length of the shortest uv-path in G. A uv-path of length dG(u, v) is called uv-geodesic. A set X is convex in G if vertices from all ab-geodesics belong to X for every two vertices a, b ∈ X. The convex domination number γcon(G) of a graph G equals the minimum cardinality of a convex dominating set. There are a larg...