نتایج جستجو برای: ivficsi cycles

تعداد نتایج: 90324  

Journal: :Discrete Applied Mathematics 1998

Journal: :Combinatorica 2005
Rom Pinchasi Micha Sharir

The Turan number of a graph G is the maximum number of edges in a graph on n vertices that does not contain G. For graphs G with χ(G) = r, a celebrated theorem of Erdős and Stone [2] states that the Turan number of G is ( r−2 r−1 + o (1) ) ( n 2 ) . For bipartite graphs, this result only tell us that the Turan number is o (n). The 3-dimensional cube Q is the graph with vertex set {0, 1} where t...

Journal: :Chemical communications 2009
Li Cai Wanyi Guan Motomitsu Kitaoka Jie Shen Chengfeng Xia Wenlan Chen Peng George Wang

Reports an efficient chemoenzymatic production of an N-acetylhexosamine 1-phophate analogues library by N-acetylhexosamine 1-kinase (NahK) and describes the respective substrate specificity on this enzyme.

Journal: :Inf. Comput. 1996
Roel Bloo Fairouz Kamareddine Rob Nederpelt

In this paper, we propose to extend the Barendregt Cube by generalising reduction and by adding definition mechanisms. We sho;' that this extension satisfies all the original properties of the Cube including Church Rosser, Subject Reduction and Strong Normalisation.

Journal: :Journal of applied microbiology 2013
J P Acevedo V Rodriguez M Saavedra M Muñoz O Salazar J A Asenjo B A Andrews

AIMS Cloning, expression and characterization of a new cold-adapted protease with potential biotechnological application, isolated from Antarctic bacteria. METHOD AND RESULTS A subtilisin-like gene was isolated from several Antarctic bacterial genus using CODPEHOP-designed primers and a genome walking method. This gene encodes a precursor protein, which undergoes an autocatalytic cleavage res...

2005
Marcin Bienkowski André Brinkmann Miroslaw Korzeniowski Orhan Orhan

Bluetooth is a wireless communication standard developed for personal area networks (PAN) that gained popularity in the last years. It was designed to connect a few devices together, however nowadays there is a need to build larger networks. Construction and maintenance algorithms have great effect on performance of the network. We present an algorithm based on Cube Connected Cycles (CCC) topol...

Journal: :BIT 1993
Ondrej Sýkora Imrich Vrto

We prove tight bounds for crossing numbers of hypercube and cube connected cyc1es (CCC) graphs.

2011
Douglas S. Stones Petr Vojtěchovský Ian M. Wanless

An autotopism of a Latin square is a triple (a,b,c) of permutations such that the Latin square is mapped to itself by permuting its rows by a, columns by b, and symbols by c. Let Atp(n) be the set of all autotopisms of Latin squares of order n. Whether a triple (a,b,c) of permutations belongs to Atp(n) depends only on the cycle structures of a, b, and c. We establish a number of necessary condi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید