We briefly review known results about the signed edge domination number of graphs. In the case of bipartite graphs, the signed edge domination number can be viewed in terms of its bi-adjacency matrix. This motivates the introduction of the signed domination number of a (0, 1)-matrix. We investigate the signed domination number for various classes of (0, 1)-matrices, in particular for regular an...

In this paper we consider the effect of edge contraction on the domination number and total domination number of a graph. We define the (total) domination contraction number of a graph as the minimum number of edges that must be contracted in order to decrease the (total) domination number. We show both of this two numbers are at most three for any graph. In view of this result, we classify gra...

Upper and lower bounds on the total domination number of the direct product of graphs are given. The bounds involve the {2}-total domination number, the total 2-tuple domination number, and the open packing number of the factors. Using these relationships one exact total domination number is obtained. An infinite family of graphs is constructed showing that the bounds are best possible. The dom...

The domination problem and its variants have been extensively studied in the literature. In this paper we investigate the domination problem in distance-hereditary graphs. In particular, we give a linear-time algorithm for the domination problem in distance-hereditary graphs by a labeling approach. We actually solve a more general problem, called the L-domination problem, which also includes th...

The six basic parameters relating to domination, independence and irredundance satisfy a chain of inequalities given by ir ≤ γ ≤ i ≤ β0 ≤ Γ ≤ IR where ir, IR are the irredundance and upper irredundance numbers, γ,Γ are the domination and upper domination numbers and i, β0 are the independent domination number and independence number respectively. In this paper, we introduce the concept of indep...

A smooth, projective surface S is called a standard isotrivial fibration if there exists a finite group G which acts faithfully on two smooth projective curves C1 and C2, so that S is isomorphic to the minimal desingularization of T := (C1 × C2)/G, where G acts diagonally on the product. When the action of G is free, then S = T is called a quasi-bundle. In this paper we analyse several numerica...

a dominating set $d subseteq v$ of a graph $g = (v,e)$ is said to be a connected cototal dominating set if $langle d rangle$ is connected and $langle v-d rangle neq phi$, contains no isolated vertices. a connected cototal dominating set is said to be minimal if no proper subset of $d$ is connected cototal dominating set. the connected cototal domination number $gamma_{ccl}(g)$ of $g$ is the min...

We present some constructions of limits and colimits in pro-categories. These are critical tools in several applications. In particular, certain technical arguments concerning strict pro-maps are essential for a theorem about étale homotopy types. Also, we show that cofiltered limits in pro-categories commute with finite colimits.

Floer cohomology groups are usually defined over a field of formal functions (a Novikov field). Under certain assumptions, one can equip them with connections, which means operations of differentiation with respect to the Novikov variable. This allows one to write differential equations for Floer cohomology classes. Here, we apply that idea to symplectic cohomology groups associated to Lefschet...

(1.1) H = {(x, y) ∈ (C) × C : y1y2 + p(x) = z}, Here, p : (C) → C is the superpotential mirror to Y (following [7] or [9]), and z is any regular value of p. H is an affine threefold with trivial canonical bundle. Hence, it has a Fukaya category Fuk(H), whose objects are compact exact Lagrangian submanifolds equipped with gradings and Spin structures. This is an A∞-category over C. Consider the ...