Results 241 to 250 of about 10,577,886 (268)

K-Factor Theory

Fall Meeting of the Society of Petroleum Engineers of AIME, 1971
Abstract It is the purpose of this paper to outline the present state of art for determining K-factors, in particular those which apply to volatile oil and condensate fluids. Equations are presented that can be used to select K-factors for volatile fluids through convergence pressure calculations.
C.S. Kaliappan, Allen M. Rowe
openaire   +2 more sources

(k+1)-Cores Have k-Factors

Combinatorics, Probability and Computing, 2012
We prove that the threshold for the appearance of a k-regular subgraph in Gn,p is at most the threshold for the appearance of a non-empty (k+1)-core. This improves a result of Pralat, Verstraete and Wormald [5] and proves a conjecture of Bollobás, Kim and Verstraete [3].
Chan, Siu On, Molloy, Michael
openaire   +1 more source

Orthogonal [k − 1, k + 1]-factorizations in graphs

Journal of Statistical Planning and Inference, 1996
Let \(G\) be a graph. Let \(F= \{F_1, F_2,\dots, F_d\}\) be a factorization of \(G\), and let \(H\) be a subgraph of \(G\). If \(H\) has exactly one edge in common with \(F_i\) for all \(i= 1,2,\dots, d\), then we say that \(F\) is orthogonal to \(H\). This paper proves that for any \(d\)-matching \(M\) of a \([kd- 1, kd+ 1]\)-graph \(G\), there is a \(
Liu, Guizhen, Yan, Guiying
openaire   +2 more sources

{k, r – k}-Factors of r-Regular Graphs

Graphs and Combinatorics, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Akbari, Saieed, Kano, Mikio
openaire   +2 more sources

k-regular factors and semi-k-regular factors in bipartite graphs

Annals of Combinatorics, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

k-factors in regular graphs

Acta Mathematica Sinica, English Series, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shiu, Wai Chee, Liu, Guizhen
openaire   +2 more sources