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

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

‎In this paper‎, ‎we introduce the notion of strongly $k-$spaces (with the weak (=finest) pre-topology generated by their strongly compact subsets)‎. ‎We characterize the strongly $k-$spaces and investigate the relationships between preclosedness‎, ‎locally strongly compactness‎, ‎pre-first countableness and being strongly $k-$space.

Journal: :journal of sciences, islamic republic of iran 2011
b davaz

the concept of algebraic hyperstructures introduced by marty as a generalization of ordinary algebraic structures. in an ordinary algebraic structure, the composition of two elements is an element, while in an algebraic hyperstructure, the composition of two elements is a set. the concept of ?-semihyperrings is a generalization of semirings, a generalization of semihyper rings and a generalizat...

Journal: :bulletin of the iranian mathematical society 0
r. kafshgarzaferani

0

2004
Pietro Baroni Massimiliano Giacomin

In argumentation theory, Dung’s abstract framework provides a unifying view of several alternative semantics based on the notion of extension. Recently, a new semantics has been introduced to solve the problems related to counterintuitive results produced by literature proposals. In this semantics, extensions can be decomposed and constructed along the strongly connected components of the defea...

Journal: :Des. Codes Cryptography 2012
Tao Feng Fan Wu Qing Xiang

We construct twelve infinite families of pseudocyclic and non-amorphic association schemes, in which each nontrivial relation is a strongly regular graph. Three of the twelve families generalize the counterexamples to A. V. Ivanov’s conjecture by Ikuta and Munemasa [13].

Journal: :Order 2013
Stephan Foldes Russ Woodroofe

Rival and Zaguia showed that the antichain cutsets of a finite Boolean lattice are exactly the level sets. We show that a similar characterization of antichain cutsets holds for any strongly connected poset of locally finite height. As a corollary, we characterize the antichain cutsets in semimodular lattices, supersolvable lattices, Bruhat orders, locally shellable lattices, and many more. We ...

Journal: :J. Comb. Theory, Ser. A 2002
Zvonimir Janko Hadi Kharaghani

A block negacyclic Bush-type Hadamard matrix of order 36 is used in a symmetric BGW(26, 25, 24) with zero diagonal over a cyclic group of order 12 to construct a twin strongly regular graph with parameters v=936, k=375, l=m=150 whose points can be partitioned in 26 cocliques of size 36. The same Hadamard matrix then is used in a symmetric BGW(50, 49, 48) with zero diagonal over a cyclic group o...

Journal: :Discrete Mathematics 2011
Majid Behbahani Clement W. H. Lam

Journal: :Australasian J. Combinatorics 2015
Liz Lane-Harvard Tim Penttila

We construct two-intersection sets in PG(5, q), q odd, admitting PSL(2, q), whose associated strongly regular graphs have the same parameters as, but are not isomorphic to, Paley graphs.

2015
Hartmut Hafermann Erik G. C. P. van Loon Mikhail I. Katsnelson Alexander I. Lichtenstein Olivier Parcollet

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

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