Optimality Theory (OT) and Harmonic Grammar (HG) differ because the former assumes a model of constraint interaction based on strict domination, while the latter assumes a weighted model of interaction. As Prince and Smolensky (1997) admit, “that strict domination governs grammatical constraint interaction is not currently explained”. Yet, Legendre et al. (2006, 911-912) make two suggestions. T...

We show that the diameter of a total domination vertex-critical graph is at most 5(γt −1)/3, and that the diameter of an independent domination vertex-critical graph is at most 2(i− 1). For all values of γt ≡ 2 (mod 3) there exists a total domination vertex-critical graph with the maximum possible diameter. For all values of i ≥ 2 there exists an independent domination vertex-critical graph wit...

This paper studies Upper Domination, i.e., the problem of computing the maximum cardinality of a minimal dominating set in a graph, with a focus on parameterised complexity. Our main results include W[1]-hardness for Upper Domination, contrasting FPT membership for the parameterised dual Co-Upper Domination. The study of structural properties also yields some insight into Upper Total Domination...

Let G = (V , E) be a graph. A subset D ⊆ V is a dominating set if every vertex not in D is adjacent to a vertex in D. A dominating set D is called a total dominating set if every vertex in D is adjacent to a vertex in D. The domination (resp. total domination) number of G is the smallest cardinality of a dominating (resp. total dominating) set of G. The bondage (resp. total bondage) number of a...

In this paper we compute for paths and cycles certain graph domination invariants like locating domination number, differentiating domination number, global alliance number etc., We also do some comparison analysis of certain parameters defined by combining the domination measures and the second smallest eigen value of the Laplacian matrix of all connected graphs of order 4.While discussing app...

The problem of monitoring an electric power system by placing as few phase measurement units (PMUs) in the system as possible is closely related to the well-known domination problem in graphs. The power domination number γp(G) is the minimum cardinality of a power dominating set of G. In this paper, we investigate the power domination problem in Mycielskian and generalized Mycielskian of graphs...

A graph is k-domination-critical if γ(G)=k, and for any edge e not in G, γ(G+e) = k-1. In this paper we show that the diameter of a domination k-critical graph with k≥2 is at most 2k-2. We also show that for every k≥2, there is a k-domination-critical graph having diameter 3 2 k 1 −     . We also show that the diameter of a 4-domination-critical graph is at most 5.

Let denote the Cartesian product of graphs and A total dominating set of with no isolated vertex is a set of vertices of such that every vertex is adjacent to a vertex in The total domination number of is the minimum cardinality of a total dominating set. In this paper, we give a new lower bound of total domination number of using parameters total domination, packing and -domination numbers of ...

A caterpillar is a tree with the property that after deleting all its vertices of degree 1 a simple path is obtained. The signed 2-domination number γ s (G) and the signed total 2-domination number γ st(G) of a graph G are variants of the signed domination number γs(G) and the signed total domination number γst(G). Their values for caterpillars are studied.