نتایج جستجو برای: strongly e regular space

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

Journal: :Discrete Mathematics 2006
Nick C. Fiala Willem H. Haemers

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

Journal: :Electr. J. Comb. 2003
Leif K. Jørgensen Mikhail H. Klin

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

Journal: :Electr. J. Comb. 2006
Kris Coolsaet Jan Degraer Edward Spence

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.

2000
Kyobum Ku Dongsung Kim JongHyo Kim

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

Journal: :Electronic Notes in Discrete Mathematics 2006
Patric R. J. Östergård Petteri Kaski

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

1998
Sergey Korotov

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.

Journal: :Proceedings of the Japan Academy, Series A, Mathematical Sciences 1973

Journal: :Proceedings of the Japan Academy, Series A, Mathematical Sciences 1971

Journal: :Journal of Combinatorial Theory, Series A 2013

Journal: :SSRN Electronic Journal 2008

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

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