𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Evolution equations on locally closed graphs and applications

✍ Scribed by Mihai Necula; Marius Popescu; Ioan I. Vrabie

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
370 KB
Volume
71
Category
Article
ISSN
0362-546X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On constructible graphs, locally Helly g
On constructible graphs, locally Helly graphs, and convexity
✍ Norbert Polat πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 162 KB

## Abstract A (finite or infinite) graph __G__ is __constructible__ if there exists a well‐ordering ≀ of its vertices such that for every vertex __x__ which is not the smallest element, there is a vertex __y__ < __x__ which is adjacent to __x__ and to every neighbor __z__ of __x__ with __z__ < __x_

Diophantine equations , odd graphs, and
Diophantine equations , odd graphs, and their applications
✍ Chun-Gang Ji πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 239 KB

Let D > 2 be a square-free integer and define a direct graph G(D) such that the vertices of the graph are the primes p i dividing D, and the arcs are determined by conditions on the quadratic residues (p i /p j ). In this paper, our main result is that x 2 -Dy 2 = k, where k = -1, Β±2, is solvable if