نتایج جستجو برای: strongly triangular graph
تعداد نتایج: 429052 فیلتر نتایج به سال:
Our general investigation of universal algebras obtained from multialgebras via strongly regular equivalence relations provides useful general results concerning fuzzy set topics related to multialgebra theory. We also give many hints on how to connect our approach with the results from the literature. Acknowledgement. The first author was supported by the CNCS-UEFISCDI grant PNII-RU-TE-2011-3-...
We present new abelian partial difference sets and amorphic group schemes of both Latin square type and negative Latin square type in certain abelian p-groups. Our method is to construct what we call pseudo-quadratic bent functions and use them in place of quadratic forms. We also discuss a connection between strongly regular bent functions and amorphic group schemes.
In this note we prove that bent functions can be precisely characterized in terms of a special class of strongly regular graphs, thus providing a positive answer to a question raised in the paper Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem. (After publication of the above paper by the rst two authors, the third sent them a remark showing that bent functions are exactly ...
Consider G(E,V) be a finite, undirected and simple connected graph. This paper includes study of some properties that illustrate the relations between three numbers in a graph which are chromatic, domination, and independence with special restrictions. Finally, we compute these parameters in a new graph namely K4 -isosceles triangular graph.
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.
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید