Results 261 to 270 of about 1,357,146 (299)

Factorization and circuit in the connection method

Journal of the ACM, 1993
Summary: A means of combining several search-space pruning rules, including factorization and circuit, into \textit{W. Bibel}'s connection method, is considered.
openaire   +1 more source

Kinetic Steric Factors and Connectivity Indices

Journal of Pharmaceutical Sciences, 1984
In this study the relationships between previously reported connectivity indices described by Kier and Hall and steric contributions to the rate constants for several series of reactions are examined. Rate data were examined for four different series of reactions, which were chosen to represent a range of different reaction mechanisms and transition ...
J C, Schug, J W, Viers, J I, Seeman
openaire   +2 more sources

Embedding connected factorizations II

Journal of Combinatorial Theory, Series B
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amin Bahmanian, Anna Johnsen-Yu
openaire   +2 more sources

Punishing Factors for Finitely Connected Domains

Monatshefte für Mathematik, 2005
For finitely connected hyperbolic domains \(\Omega\) and \(\Pi\) in the complex plane, let \(R(z,\Omega)\) denote the hyperbolic radius of \(\Omega\) at \(z\) and \(R(w,\Pi)\) the hyperbolic radius of \(\Pi\) at \(w\). The set of functions \(f\) that are analytic in \(\Omega\) and such that all values \(f(z)\) lie in \(\Pi\) is denoted by \(A(\Omega ...
Avkhadiev F., Wirths K.
openaire   +4 more sources

The School Connection Scale: A Factor Analysis

Psychological Reports, 2000
An individual's feeling of connection with a social system has been viewed by diverse traditions as an important predictor of social behavior. While some of these theoretical traditions have conceptualized and assessed a feeling of connection as a global phenomenon, more recent work has focused on the development of measures for separate contexts in ...
R A, Brown, G K, Leigh, K, Barton
openaire   +2 more sources

Connective Tissue Growth Factor

Arteriosclerosis, Thrombosis, and Vascular Biology, 1997
Abstract Connective tissue growth factor (CTGF) is a novel cysteine-rich, secreted peptide, which is implicated in human atherosclerosis and fibrotic disorders such as systemic scleroderma. CTGF is a member of the peptide family that includes serum-induced immediate early gene products, a v- src –induced
B S, Oemar, T F, Lüscher
openaire   +2 more sources

Independence number, connectivity, and r‐factors

Journal of Graph Theory, 1989
AbstractWe show that if r ⩾ 1 is an odd integer and G is a graph with |V(G)| even such that k(G) ⩾ (r + 1)2/2 and (r + 1)2α(G) ⩽ 4rk(G), then G has an r‐factor; if r ⩾ 2 is even and G is a graph with k(G) ⩾ r(r + 2)/2 and (r + 2)α(G) ⩽ 4k(G), then G has an r‐factor (where k(G) and α(G) denote the connectivity and the independence number of G ...
openaire   +1 more source

CCN2, the connective tissue growth factor

Journal of Molecular Medicine, 2007
The role of extracellular matrix proteins in signaling control and regulation of response to injury, particularly in terms of scarring, is a topic of major importance. Blatant clinical examples of disturbed scarring are keloid production and systemic sclerosis, better known as scleroderma [1, 2].
openaire   +2 more sources

A degree condition for the existence of connected factors [PDF]

Australas. J Comb., 1996
Summary: Let \(G\) be a connected graph of order \(n\), let \(f\) and \(g\) be two positive integer functions defined on \(V(G)\) satisfying \(2\leq f(v)\leq g(v)\) for each vertex \(v\in V(G)\). We prove that if \(G\) has a \([f,g]\)-factor \(F\) and, moreover, among any three independent vertices of \(G\) there are (at least) two vertices with degree
Yanjun Li, Mao-cheng Cai
openaire   +1 more source

On edge connectivity and parity factor

Acta Mathematica Sinica, English Series, 2015
This paper considers some sufficient conditions for a graph to have an even and even factor with restricted minimum degree and edge connectivity. In particular, the authors prove that every \(n\)-edge-connected graph with minimum degree at least \(n+1\) contains an even factor with minimum degree at least \(n\), and very \((m+1)\)-edge-connected graph ...
Lu, Hong Liang, Wang, Wei, Lin, Yuqing
openaire   +2 more sources