نتایج جستجو برای: leap graphs

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

Journal: :Astronomy & Geophysics 2005

2010
Hannah Nola Thompson Hannah Thompson

............................................................................................................................................ 2 ACKNOWLEDGEMENTS ....................................................................................................................... 4 CONTENTS .............................................................................................................

2017
Sang Yoon Lee Yoon Kwon Nam

Background: Liver-expressed antimicrobial peptide-2 (LEAP-2) is an important component of innate immune system in teleosts. In order to understand isoform-specific involvement and regulation of LEAP-2 genes in mud loach (Misgurnus mizolepis, Cypriniformes), a commercially important food fish, this study was aimed to characterize gene structure and expression characteristics of two paralog LEAP-...

1989
Frank Pfenning Peter Lee

We describe the core of a new strongly-typed functional programming language called LEAP, a \Language with Eval And Polymorphism." Pure LEAP is an extension of the !-order polymorphic -calculus (F ! ) by global de nitions that allows the representation of programs and the de nition of versions of reify, reflect, and eval for all of F ! . Pure LEAP is therefore highly re exive and strongly typed...

Journal: :Des. Codes Cryptography 2012
Hyonju Yu

In this paper, we give infinitely many examples of (non-isomorphic) connected k-regular graphs with smallest eigenvalue in half open interval [−1− √ 2,−2) and also infinitely many examples of (non-isomorphic) connected k-regular graphs with smallest eigenvalue in half open interval [α1,−1− √ 2) where α1 is the smallest root(≈ −2.4812) of the polynomial x3 + 2x2 − 2x − 2. From these results, we ...

2017
Sapna Mehta

iv Acknowledgements v List of Tables vii List of Graphs vii

2009
Chaoyan Wang

................................................................................................................................................. 3 Acknowledgements................................................................................................................................ 6 List of Tables...........................................................................................

Journal: :Undergraduate Research Journal for the Humanities 2016

Journal: :transactions on combinatorics 2013
alireza abdollahi shahrooz janbaz mohammad reza oboudi

let $n$ be any positive integer and let $f_n$ be the friendship (or dutch windmill) graph with $2n+1$ vertices and $3n$ edges. here we study graphs with the same adjacency spectrum as the $f_n$. two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. let $g$ be a graph cospectral with $f_n$. here we prove that if $g$ has no cycle of length $4$ or $...

1988
David F. Anderson

By explicitly representing well-stirred chemical reaction systems with independent, unit Poisson processes we develop a new adaptive tau-leaping procedure. The procedure developed is novel in that we enforce any leap condition via a post-leap check as opposed to performing a pre-leap tau selection. Further, we perform the post-leap check in such a way that the statistics of the sample paths gen...

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

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