In this paper, we completely determine the connectivity of every infinite circulant digraphs and prove that almost all infinite circulant digraphs are infinitely strongly connected and therefore have both oneand two-way infinite Hamiltonian paths.

Using two backtrack algorithms based on different techniques, designed and implemented independently, we were able to determine up to isomorphism all strongly regular graphs with parameters v = 45, k = 12, λ = μ = 3. It turns out that there are 78 such graphs, having automorphism groups with sizes ranging from 1 to 51840.

We consider strongly connected networks of input-to-state stable (ISS) systems. Provided a small gain condition holds it is shown how to construct an ISS Lyapunov function using ISS Lyapunov functions of the subsystems. The construction relies on two steps: The construction of a strictly increasing path in a region defined on the positive orthant in R by the gain matrix and the combination of t...

This paper presents a fully automatic segmentation method for the virtual bronchoscopy, which requires the segmentation of a trachea and left/right bronchi. A trachea region is automatically detected, based on medical knowledge and DICOM header information, and its center point is selected as a seed point for the slice-based 3D Seeded Region Growing(SRG). The slice-based 3D SRG grows a region b...

A biplane is a 2-(k(k − 1)/2 + 1, k, 2) symmetric design. Only sixteen nontrivial biplanes are known: there are exactly nine biplanes with k < 11, at least five biplanes with k = 11, and at least two biplanes with k = 13. It is here shown by exhaustive computer search that the list of five known biplanes with k = 11 is complete. This result further implies that there exists no 3-(57, 12, 2) des...

Higlighting certain similarities between the two-dimensional Luttinger liquid model and the effective fermionic theory obtained from the hypercharge Lagrangian, we argue the case for a new type of Standard Model extension.

Obtaining start-up funding for new product ideas in large corporations is inherently frustrating. We evaluated teams that were successful in obtaining start-up funds from large corporations to determine the importance of the executive champion and team commitment and conflict. We found that the funding level was strongly correlated (R=0.104; p=0.002) with higher levels (β=0.193; p=0.016) of cha...

The existence of a partial quadrangle PQ(s, t, μ) is equivalent to the existence of a diamond-free strongly regular graph SRG(1+s(t+1)+s2t(t+1)/μ, s(t+1), s−1, μ). Let S be a PQ(3, (n + 3)(n2 − 1)/3, n2 + n) such that for every two non-collinear points p1 and p2, there is a point q non-collinear with p1, p2, and all points collinear with both p1 and p2. In this article, we establish that S exis...

In this paper, we begin the determination of all primitive strongly regular graphs with chromatic number equal to 5. Using eigenvalue techniques, we show that there are at most 43 possible parameter sets for such a graph. For each parameter set, we must decide which strongly regular graphs, if any, possessing the set are 5-chromatic. In this way, we deal completely with 34 of these parameter se...