An Optimal Binding Number Condition for Bipancyclism

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Optimal Binding Number Condition for Bipancyclism

Let G = (V1, V2, E) be a balanced bipartite graph with 2n vertices. The bipartite binding number of G, denoted by B(G), is defined to be n if G = Kn,n and min i∈{1,2} min ∅̸=S⊆Vi |N(S)| 3/2 and n ≥ 139, then G is bipancyclic; the bound 3/...

متن کامل

Title An Optimal Binding Number Condition for Bipancyclism

Let G = (V1, V2, E) be a balanced bipartite graph with 2n vertices. The bipartite binding number of G, denoted by B(G), is defined to be n if G = Kn,n and mini∈ {1,2} min ∅ =S⊆Vi |N(S)| 3/2 and n ≥ 139, then G is bipancyclic; the bound 3...

متن کامل

Investigation of optimal condition for Chlorella vulgaris microalgae growth

Due to its abundance and also flexibility of cultivation conditions, Chlorella vulgaris microalgae is one of the most ideal options available in order to production of microalgae based biodiesel. Since vulgaris cultivation for fuel production needs economic considerations to be taken, and in first place providing biomass and lipid production costs is important, wide researches have bee...

متن کامل

Towards an optimal condition number of certain augmented Lagrangian-type saddle-point matrices

We present an analysis for minimizing the condition number of nonsingular parameter-dependent 2 2 block-structured saddle-point matrices with a maximally rank-deficient (1,1) block. The matrices arise from an augmented Lagrangian approach. Using quasidirect sums, we show that a decomposition akin to simultaneous diagonalization leads to an optimization based on the extremal nonzero eigenvalues ...

متن کامل

Asymptotically Optimal Lower Bounds for the Condition Number of a Real Vandermonde Matrix

Lower bounds on the condition number minκp(V ) of a Vandermonde matrix V are established in terms of the dimension n or n and the largest absolute value among all nodes that define the Vandermonde matrix. Many bounds here are asymptotically sharp, and compare favorably to those of the same kind due to Gautschi and Inglese (Numer. Math., 52 (1988), 241–250) who considered either all positive nod...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Discrete Mathematics

سال: 2013

ISSN: 0895-4801,1095-7146

DOI: 10.1137/120886443