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

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

2016
E. Mohammadzadeh T. Nozari

In this paper we introduce the smallest equivalence relation ξ∗ on a finite fuzzy hypergroup S such that the quotient group S/ξ∗, the set of all equivalence classes, is a solvable group. The characterization of solvable groups via strongly regular relation is investigated and several results on the topic are presented.

Journal: :Electr. J. Comb. 2006
Anka Golemac Josko Mandic Tanja Vucicic

New (96,20,4,4) and (96,19,2,4) regular partial difference sets are constructed, together with the corresponding strongly regular graphs. Our source are (96,20,4) regular symmetric designs.

1997
Antonín Kucera

We examine the problem of finite-state representability of infinitestate processes w.r.t. certain behavioural equivalences. We show that the classical notion of regularity becomes insufficient in case of all equivalences of van Glabbeek’s hierarchy except bisimilarity, and we design and justify a generalization in the form of strong regularity and finite characterizations. We show that the cond...

Journal: :Discrete Mathematics 1995
Andries E. Brouwer

We show for many strongly regular graphs ∆, and for all Taylor graphs ∆ except the hexagon, that locally ∆ graphs have bounded diameter.

2017
BIN XU

This paper begins the project of adapting the 1992 book by Adams, Barbasch and Vogan on the Langlands classification of admissible representations of real groups, to padic groups, continuing in the direction charted by Vogan in his 1993 paper on the Langlands correspondence. This paper presents three theorems in that direction. The first theorem shows how Lusztig’s work on perverse sheaves aris...

Journal: :Australasian J. Combinatorics 2017
Shubhada M. Nyayate Rajendra M. Pawale Mohan S. Shrikhande

A quasi-symmetric design (QSD) is a (v, k, λ) design with two intersection numbers x, y, where 0 ≤ x < y < k. The block graph of a QSD is a strongly regular graph (SRG), whereas the converse is not true. Using Neumaier’s classification of SRGs related to the smallest eigenvalue, a complete parametric classification of QSDs whose block graph is an SRG with smallest eigenvalue −3, or second large...

Journal: :Electr. J. Comb. 2016
Anurag Bishnoi Bart De Bruyn

We construct and study a new near octagon of order (2, 10) which has its full automorphism group isomorphic to the group G2(4) : 2 and which contains 416 copies of the Hall-Janko near octagon as full subgeometries. Using this near octagon and its substructures we give geometric constructions of the G2(4)-graph and the Suzuki graph, both of which are strongly regular graphs contained in the Suzu...

Journal: :Comp. Opt. and Appl. 2012
Francisco J. Aragón Artacho Michaël Gaydu

We consider a generalized version of the proximal point algorithm for solving the perturbed inclusion y ∈ T (x), where y is a perturbation element near 0 and T is a set-valued mapping acting from a Banach space X to a Banach space Y which is metrically regular around some point point (x̄, 0) in its graph. We study the behavior of the convergent iterates generated by the algorithm and we prove th...

2015
Slavko Moconja

We investigate if every quasi-minimal group is abelian, and give a positive answer for a quasi-minimal pure group having a ∅-definable partial order with uncountable chains. We also relate two properties of a complete theory in a countable language: the existence of a quasi-minimal model and the existence of a strongly regular type. As a consequence we derive the equivalence of conjectures on c...

Journal: :Eur. J. Comb. 2007
Chris D. Godsil Sylvia A. Hobart William J. Martin

We develop a theory of representations in Rm for directed strongly regular graphs, which gives a new proof of a nonexistence condition of Jørgensen [8]. We also describe some new constructions.

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

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