Results 1 to 10 of about 3,100,536 (300)
Some of the next articles are maybe not open access.
Strongly regular graphs constructed from p-ary bent functions
Journal of Algebraic Combinatorics, 2010Su Yin Tan
exaly
Strongly regular graphs with maximal energy
Linear Algebra and Its Applications, 2008Willem Haemers
exaly
On the Complexity of Canonical Labeling of Strongly Regular Graphs
SIAM Journal on Computing, 1980László Babai
exaly
A generalization of Wallis-Fon-Der-Flaass construction of strongly regular graphs
Journal of Algebraic Combinatorics, 2006Mikhail Muzychuk
exaly
Strongly regular graphs associated with ternary bent functions
Journal of Combinatorial Theory - Series A, 2010Alexander Pott, Tao Feng, Su Yin Tan
exaly
Some Chemistry Indices of Clique-Inserted Graph of a Strongly Regular Graph
Complexity, 2021 In this paper, we give the relation between the spectrum of strongly regular graph and its clique-inserted graph. The Laplacian spectrum and the signless Laplacian spectrum of clique-inserted graph of strongly regular graph are calculated.
Chun-Li Kan +3 more
doaj +2 more sources
Spreads in Strongly Regular Graphs [PDF]
Designs, Codes and Cryptography, 1996 A spread in any geometry is a set of pairwise disjoint lines that cover all the points. For a partial geometry the point graph (collinearity graph) is strongly regular. Delsarte showed that a clique in a strongly regular graph has at most \(K = 1 - k/s\) vertices, where \(k\) and \(s\) are the largest and smallest eigenvalues of the graph respectively.
Willem H. Haemers, Vladimir D. Tonchev
core +7 more sources
Hamiltonian Strongly Regular Graphs [PDF]
SSRN Electronic Journal, 2008 We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected non-Hamiltonian strongly regular graph on fewer than 99 vertices.
Brouwer, A.E., Haemers, W.H.
openaire +7 more sources