𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Search for properties of the missing Moore graph

✍ Scribed by Martin Mačaj; Jozef Širáň

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
237 KB
Volume
432
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Searching for missing pieces of the sex-
Searching for missing pieces of the sex-determination puzzle
✍ Bullejos, Monica ;Bowles, Josephine ;Koopman, Peter 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 383 KB

## Abstract Little is known of the mechanisms whereby the mammalian indifferent gonad develops into a testis or ovary. In XY individuals, __Sry__, the mammalian testis‐determining gene, is expressed in the pre‐Sertoli cells, which then differentiate into Sertoli cells. Other cell types, which inclu

Searching for acyclic orientations of gr
Searching for acyclic orientations of graphs
✍ Martin Aigner; Eberhard Triesch; Zsolt Tuza 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 397 KB

We want to find an unknown acyclic orientation ~\* of an (undirected) graph G by testing for certain edges how they are oriented according to ~\*. How many tests do we need in the worst case? We give upper and lower bounds for this number c(G) in terms of the independence number of G and study the c

Tabu search for the Steiner problem in g
Tabu search for the Steiner problem in graphs
✍ Celso C. Ribeiro; Maurício C. De Souza 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB 👁 2 views

Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum-weighted subgraph spanning a given subset of nodes (terminals) of the original graph. In this paper, we describe a tabu search algorithm for the Steiner problem in graphs, based o

The Penultimate Rate of Growth for Graph
The Penultimate Rate of Growth for Graph Properties
✍ József Balogh; Béla Bollobás; David Weinreich 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 166 KB

Given a property P of graphs, write P n for the set of graphs with vertex set [n] having property P. We call |P n | the speed of P. Recent research has shown that the speed of a monotone or hereditary property P can be a constant, polynomial, or exponential function of n, and the structure of the gr