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

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

Journal: :Eur. J. Comb. 2008
Kris Coolsaet Aleksandar Jurisic Jacobus H. Koolen

Let Γ be a triangle-free distance-regular graph with diameter d ≥ 3, valency k ≥ 3 and intersection number a2 6= 0. Assume Γ has an eigenvalue with multiplicity k. We show that Γ is 1-homogeneous in the sense of Nomura when d = 3 or when d ≥ 4 and a4 = 0. In the latter case we prove that Γ is an antipodal cover of a strongly regular graph, which means that it has diameter 4 or 5. For d = 5 the ...

Journal: :Discrete Mathematics 1975

Journal: :Journal of Algebra 1991

Journal: :Designs, Codes and Cryptography 2022

We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries their generalizations or elliptic semiplanes are constructed. Necessary existence conditions proved a table of feasible parameters at most 200 points is presented. Non-existence some proved.

Journal: :Frontiers in Bioengineering and Biotechnology 2021

Long-term follow-up studies on children with surgically treated developmental dysplasia of the hip (DDH) have shown that not only affected side progresses to premature osteoarthritis, but unaffected may also suffer from insidious or osteonecrosis. The current gait analysis study identified loading and unloading rates ground reaction forces (GRF) lower limb joint axial during gait, their correla...

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

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

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