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

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

Journal: :Des. Codes Cryptography 2016
Zhengchun Zhou Nian Li Cuiling Fan Tor Helleseth

Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of p-ary linear codes with two or three weights are constructed from quadratic Bent functions over the finite field Fp, where p is an odd prime. They include some earlier linear codes as special cases. The weight distributions...

Journal: :Discrete Mathematics 2008
Jan Degraer Kris Coolsaet

By means of an exhaustive computer search we have proved that the strongly regular graphs with parameters (v, k, λ, μ) = (105, 32, 4, 12), (120, 42, 8, 18) and (176, 70, 18, 34) are unique upto isomorphism. Each of these graphs occurs as an induced subgraph in the strongly regular McLaughlin graph. We have used an orderly backtracking algorithm with look-ahead and look-back strategies, applying...

2010
ROBERT A. HERRMANN R. A. HERRMANN

We use nonstandard topology and the g-topology to characterize normal, almost-normal, regular, almost-regular, semiregular spaces. The cluster [resp. 0-cluster] set relation is used to characterize regular, almostregular [resp. strongly-regular] spaces. The Whyburn [resp. Dickman] filter bases are characterized and it is shown that the cluster [resp. f-cluster] set relation restricted to the do...

Journal: :Finite Fields and Their Applications 2014
Koji Momihara Qing Xiang

Article history: Received 21 December 2012 Received in revised form 11 November 2013 Accepted 14 November 2013 Available online 12 December 2013 Communicated by Igor Shparlinski

2008
Henk D. L. Hollmann

The group PGL(2, q) has an embedding into PGL(3, q) such that it acts as the group fixing a nonsingular conic in PG(2, q). This action affords a coherent configuration R(q) on the set L(q) of non-tangent lines of the conic. We show that the relations can be described by using the cross-ratio. Our results imply that the restrictions R+(q) and R−(q) of R(q) to the set L+(q) of secant (hyperbolic)...

2013
R. Ameri R. Sadeghi

We introduced and study fuzzy Γ-hypersemigroups, according to fuzzy semihypergroups as previously defined [33] and prove that results in this respect. In this regard first we introduce fuzzy hyperoperation and then study fuzzy Γ-hypersemigroup. We will proceed by study fuzzy Γ-hyperideals and fuzzy Γ-bihyperideals. Also we study the relation between the classes of fuzzy Γ-hypersemigroups and Γ-...

2014
Siyang Yu Dong-Hee Lee Jin-Woo Ahn

This paper introduces the high efficiency operation of switched reluctance generator (SRG). The proposed SRG operates under the rated speed. The high efficiency can be obtained by the optimal current shape which can make the total losses minimum. For this purpose, theoretical analysis of the copper and core loss is done. In addition, a modified angle position control (MAPC) method which can get...

Journal: :CoRR 2017
Sihem Mesnager Ferruh Özbudak Ahmet Sinak

Linear codes with few weights have many applications in secret sharing schemes, authentication codes, communication and strongly regular graphs. In this paper, we consider linear codes with three weights in arbitrary characteristic. To do this, we generalize the recent contribution of Mesnager given in [Cryptography and Communications 9(1), 71-84, 2017]. We first present a new class of binary l...

Journal: :Des. Codes Cryptography 2017
Chunming Tang Can Xiang Keqin Feng

Linear codes with few weights have been an interesting subject of study for many years, as these codes have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, linear codes with a few weights are constructed from inhomogeneous quadratic functions over the finite field GF(p), where p is an odd prime. They include some earlier li...

2008
Günter M. Ziegler

We introduce the fatness parameter of a 4-dimensional polytope P, defined as φ(P) = ( f1 + f2)/( f0 + f3). It arises in an important open problem in 4-dimensional combinatorial geometry: Is the fatness of convex 4polytopes bounded? We describe and analyze a hyperbolic geometry construction that produces 4-polytopes with fatness φ(P) > 5.048, as well as the first infinite family of 2-simple, 2-s...

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

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