Buscar
Mostrando ítems 1-10 de 48412
On the thinness and proper thinness of a graph
(Elsevier Science, 2019-05)
Graphs with bounded thinness were defined in 2007 as a generalization of interval graphs. In this paper we introduce the concept of proper thinness, such that graphs with bounded proper thinness generalize proper interval ...
Minimal proper interval completions
(2008)
Given an arbitrary graph and a proper interval graph with we say that H is a proper interval completion of G. The graph H is called a minimal proper interval completion of G if, for any sandwich graph with , is not a ...
New proper motion members of Cygnus OB2 - Other overdensities: Right over-density proper motion members and Left over-density proper motion members
Gaia DR2 five astrometric parameters and magnitude of the proper motion members of the association Cygnus OB2 and of the substructures named 'Right over-density' and 'Left over-density' are presented. For each group the ...
A Functional Discourse Grammar account of proper names in Portuguese
(2022-01-01)
A generally accepted view regarding proper names is that they have reference, but no lexical meaning (Lyons, 1977). This idea is the basis for the Functional Discourse Grammar (Hengeveld & Mackenzie, 2008) view of proper ...
Proper subspaces and compatibility
(Polish Acad Sciences Inst Mathematics, 2015-12)
Let E be a Banach space contained in a Hilbert space L. Assume thatthe inclusion is continuous with dense range. Following the terminology of Gohberg andZambicki, we say that a bounded operator on E is a proper operator ...
On the existence and construction of proper costratifying systems
(Taylor & Francis, 2013-10)
In this paper we further study the notion of proper costratifying systems, defined in [MPV]. We give sufficient conditions for their existence, and investigate the relation between the stratifying systems defined by K. ...
PROPER-MOTION SURVEY .1. COMMON-PROPER-MOTION SYSTEMS IN ESO AREAS 439 AND 440
(AMER INST PHYSICS, 1990-03)
Minimal proper interval completions
(2006)
Given an arbitrary graph G=(V,E) and a proper interval graph H=(V,F) with E ⊆ F we say that H is a proper interval completion of G. The graph H is called a minimal proper interval completion of G if, for any sandwich ...