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

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

1996
F. Shahrokhi

We introduce a general framework to estimate the crossing number of a graph on a compact 2-manifold in terms of the crossing number of the complete graph of the same size on the same manifold. The bounds are tight within a constant multiplicative factor for many graphs, including hypercubes, some complete bipartite graphs and random graphs. We determine the crossing number of a complete graph, ...

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.

Journal: :Linear Algebra and its Applications 2017

Journal: :Contributions to Discrete Mathematics 2008
Akihiro Munemasa Takuya Ikuta

E. R. van Dam gave an example of primitive non-amorphous association schemes in which every nontrivial relation is a strongly regular graph, as a fusion scheme of the cyclotomic scheme of class 45 on GF(212). The aim of this paper is to present a new example of primitive non-amorphous association schemes in which every nontrivial relation is a strongly regular graph, as a fusion scheme of the c...

Journal: :Contributions to Discrete Mathematics 2009
Anthony Bonato

Almost all finite graphs have the n-e.c. adjacency property, although until recently few explicit examples of such graphs were known. We survey some recently discovered families of explicit finite n-e.c. graphs, and present a new construction of strongly regular n-e.c. arising from affine planes.

Journal: :Discrete Mathematics 1999
Robert S. Coulter Marie Henderson

We give an alternative proof of the fact that a planar function cannot exist on groups of even order. The argument involved leads us to define a class of functions which we call semi-planar. Through the introduction of an incidence structure we construct semi-biplanes using semi-planar functions. The method involved represents a new approach to constructing semi-biplanes and provides infinite c...

2008
GEORGI GANCHEV VESSELKA MIHOVA

We prove that any strongly regular Weingarten surface in Euclidean space carries locally geometric principal parameters. The basic theorem states that any strongly regular Weingarten surface is determined up to a motion by its structural functions and the normal curvature function satisfying a geometric differential equation. We apply these results to the special Weingarten surfaces: minimal su...

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

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