نتایج جستجو برای: strongly regular
تعداد نتایج: 336088 فیلتر نتایج به سال:
We prove cocompleteness of the category of CASL signatures , of monotone signatures, of strongly regular signatures and of strongly locally ltered signatures. This shows that using these signature categories is compatible with a pushout or colimit based module system.
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...
Switching of Edges in Strongly Regular Graphs I: A Family of Partial Difference Sets on 100 Vertices
We present 15 new partial difference sets over 4 non-abelian groups of order 100 and 2 new strongly regular graphs with intransitive automorphism groups. The strongly regular graphs and corresponding partial difference sets have the following parameters: (100,22,0,6), (100,36,14,12), (100,45,20,20), (100,44,18,20). The existence of strongly regular graphs with the latter set of parameters was a...
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.
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...
We present an algorithm for a construction of strongly regular families of trian-gulations for planar domains with a piecewise smooth boundary. Some additional properties of resulting triangulations are considered.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید