Results 1 to 10 of about 177,591 (297)
Complementation, local complementation, and switching in binary matroids [PDF]
In 2004, Ehrenfeucht, Harju, and Rozenberg showed that any graph on a vertex set $V$ can be obtained from a complete graph on $V$ via a sequence of the operations of complementation, switching edges and non-edges at a vertex, and local complementation. The last operation involves taking the complement in the neighbourhood of a vertex. In this paper, we
James G. Oxley, Jagdeep Singh 0002
openaire +5 more sources
Hypomorphy of graphs up to complementation [PDF]
Let $V$ be a set of cardinality $v$ (possibly infinite). Two graphs $G$ and $G'$ with vertex set $V$ are {\it isomorphic up to complementation} if $G'$ is isomorphic to $G$ or to the complement $\overline G$ of $G$. Let $k$ be a non-negative integer, $G$
Lopez, Gérard +3 more
core +8 more sources
In this paper we document the developmental trajectory of the complementizer system (CP-system) in Italian by looking at the earliest spontaneous production of eleven young children, whose transcriptions are available on CHILDES.
Vincenzo Moscati +2 more
doaj +1 more source
In viviparous mammals, genomic imprinting regulates parent-of-origin-specific monoallelic expression of paternally and maternally expressed imprinted genes (PEGs and MEGs) in a region-specific manner.
Tomoko Kaneko-Ishino, Fumitoshi Ishino
doaj +1 more source
Complement in trauma—Traumatised complement? [PDF]
Physical trauma represents a major global burden. The trauma‐induced response, including activation of the innate immune system, strives for regeneration but can also lead to post‐traumatic complications. The complement cascade is rapidly activated by damaged tissue, hypoxia, exogenous proteases and others ...
Markus S. Huber‐Lang +4 more
openaire +2 more sources
Subgraph Complementation [PDF]
AbstractA subgraph complement of the graph G is a graph obtained from G by complementing all the edges in one of its induced subgraphs. We study the following algorithmic question: for a given graph G and graph class $${\mathscr {G}}$$G, is there a subgraph complement of G which is in $${\mathscr {G}}$$G?
Fomin, Fedor V. +3 more
openaire +3 more sources
When hypotaxis looks like parataxis: embedding and complementizer agreement in Teiwa
Teiwa, an Alor-Pantar language of the Trans-New Guinea family, has been characterized as expressing speech reports not with complementation, but with combinations of two clauses juxtaposed under a single intonation contour with no morphological ...
Bart Hollebrandse +2 more
doaj +2 more sources
This paper explores the prevalent simplification of morphosyntactic features occurring in Postcolonial Englishes (cf. e.g. Williams 1987) by addressing the hypothesis that finite complement clauses (CCs) should be more common in these varieties than a ...
Laura García-Castro
doaj +1 more source
Structural Nativization in Postcolonial Englishes
Structural nativization, that is, ‘the emergence of locally characteristic linguistic patterns and thus the genesis of a new variety of English’ (Schneider 2007: 5-6), is said to be especially prone to occur in the complementation profile of verbs (and ...
Laura García-Castro
doaj +1 more source
The historical development and change of the English complementation system has received a great deal of attention in recent years, but work remains to be done on Present-day English.
Raquel P. Romasanta
doaj +1 more source

