Results 31 to 40 of about 1,255 (121)
A construction of amorphous association scheme from a pseudo-cyclic association scheme
, 2004 In this paper, we give a construction of an amorphous association scheme from a pseudo-cyclic symmetric association scheme. This construction is a generalization of the construction of strongly regular graphs due to Mathon.
Fujisaki, Tatsuya
core +1 more source
Graphs with few eigenvalues -- An interplay between combinatorics and algebra [PDF]
, 1996 Two standard matrix representations of a graph are the adjacency matrix and the Laplace matrix. The eigenvalues of these matrices are interesting parameters of the graph.
Edwin Robert van Dam, van Dam, E.R.
core
Characterization of p-ary bent functions in terms of strongly regular graphs
, 2019 A p-ary function f in n variables is an l-form if f (tu) = t l f (u) for any nonzero t in Zp and u in Zn p. Let n be a positive even integer, p an odd prime, and l an element of {1, 2, . . . , p-1} provided that l ≠= p-1 if p > 3. Let f be a p-
이윤진
core +1 more source
Graphs with Few Eigenvalues. An Interplay between Combinatorics and Algebra.
: Two standard matrix representations of a graph are the adjacency matrix and the Laplace matrix. The eigenvalues of these matrices are interesting parameters of the graph.
Dam, E.R. van
core
E.R.: Strongly regular decompositions of the complete graph
, 2003 . We study several questions about amorphic association schemes and other strongly regular decompositions of the complete graph. We investigate how two commuting edge-disjoint strongly regular graphs interact.
Edwin R Van Dam
core
, 2012 This book gives an elementary treatment of the basic material about graph spectra, both for ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering standard topics before presenting some new material on trees, strongly ...
Brouwer, Andries E +4 more
core +1 more source
, 2012 As one of the serial papers on suborbits of point stabilizers in classical groups on the last subconstituent of dual polar graphs, the corresponding problem for orthogonal dual polar graphs over a finite field of odd characteristic is discussed in this ...
Ma, Jianmin +7 more
core +1 more source
, 2003 We present 15 new partial dierence sets over 4 non-abelian groups of order 100 and 2 new strongly regular graphs with intransitive automorphism groups. The strongly regular graphs and corresponding partial dierence sets have the following parameters: (
M. Klin +3 more
core
Regular weights on strongly regular graphs.
, 1992 The concept of a regular weight on a coherent configuration (cc) was introduced by D. G. Higman in connection with centralizer algebras of monomial representations, and turns out to be a natural generalization of the work of D. E. Taylor, J. J.
Sankey, Alyssa D.
core