نتایج جستجو برای: von mise graphs

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

2008
Hamed Hatami

2 Definitions and main results 3 2.1 Notations and definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Graph norms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.3 Schatten-von Neumann classes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.4 Hölder and weakly Hölder graphs . . . . . . . . . . . . ....

2009
Chaoyan Wang

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

2013
H. M. Weingartl C. Nfon G. Kobinger

Ebola viruses (EBOV; genus Ebolavirus, family Filoviridae) cause often fatal, hemorrhagic fever in several species of simian primates including human. While fruit bats are considered a natural reservoir, the involvement of other species in the EBOV transmission cycle is unclear, especially for domesticated animals. Dogs and pigs are so far the only domestic animals identified as species that ca...

1995
Rene David Karim Nour

Storage operators have been introduced by J. L. Krivine in [5] they are closed x-terms which, for a data type, allow one to simulate a "call by value" while using the "call by name" strategy. In this paper, we introduce the directed ;,-calculus and show that it has the usual properties of the ordinary ;,-calculus. With this calculus we get an equivalent-and simple-definition of the storage oper...

Journal: :bulletin of the iranian mathematical society 2011
g. esslamzadeh m. shadab

we study topological von neumann regularity and principal von neumann regularity of banach algebras. our main objective is comparing these two types of banach algebras and some other known banach algebras with one another. in particular, we show that the class of topologically von neumann regular banach algebras contains all $c^*$-algebras, group algebras of compact abelian groups and cer...

Journal: :iranian journal of pediatric hematology and oncology 0
mahbubeh nasiri department of biology, science and research branch, islamic azad university, fars, iran h galehdari department of genetics, university of shahid chamran, ahwaz, iran.سازمان اصلی تایید شده: دانشگاه آزاد اسلامی شیراز (islamic azad university of shiraz) m darbouy department of biology, science and research branch, islamic azad university, fars, iranسازمان اصلی تایید شده: دانشگاه شهید چمران (shahid chamran university) m yavarian hematology research centre,shiraz university of medical science, shiraz, iranسازمان اصلی تایید شده: دانشگاه آزاد اسلامی شیراز (islamic azad university of shiraz) b keikhaee thalassemia and hemoglobinopathies research center, ahwaz jondishapour university of medical sciences, ahwaz, iranسازمان اصلی تایید شده: دانشگاه علوم پزشکی شیراز (shiraz university of medical sciences)

abstract background von willebrand disease (vwd) is an autosomally inherited bleeding disorder with the prevalence of 1% based on population studies. the disease phenotype is due to quantitative and structural/functional defects in von willebrand factor (vwf) which is a glycoprotein with essential role as a carrier of fviii in circulation and also it serves the function as hemostasis regulator....

2004
Ulrik Brandes Christian Pich

GraphML (Graph Markup Language) is an XML-based language for the description of network data. It is intended as a simple, extensible and general file format for archiving arbitrary graphs with arbitrary additional data. This thesis investigates GraphML processing specified by XSLT stylesheets. After an introduction into GraphML and XSLT, various use cases show that XSLT is able – as a stand-alo...

Journal: :CoRR 2017
David E. Simmons Justin P. Coon Animesh Datta

We show that the (normalized) symmetric Laplacian of a simple graph can be obtained from the partial trace over a pure bipartite quantum state that resides in a bipartite Hilbert space (one part corresponding to the vertices, the other corresponding to the edges). This suggests an interpretation of the symmetric Laplacian’s Von Neumann entropy as a measure of bipartite entanglement present betw...

2016
Kai Fieger Tomáš Balyo Peter Sanders

This thesis presents an optimal algorithm that solves the longest path problem for undirected graphs. The algorithm makes use of graph partitioning and dynamic programming. It’s performance was evaluated in a number of benchmarks and compared to other known algorithms. The runtime of the algorithm was shown to be significantly faster on the tested graphs. Deutsche Zusammenfassung Diese Arbeit p...

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 $...

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

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