Results 21 to 30 of about 11,145,283 (118)

Strongly Regular Graphs with Parameters (4m4, 2m4 + m2, m4 + m2, m4 + m2) Exist for All m>1 [PDF]

open access: yes
Using results on Hadamard difference sets, we construct regular graphical Hadamard matrices of negative type of order 4m4 for every positive integer m. If m > 1, such a Hadamard matrix is equivalent to a strongly regular graph with parameters (4m4, 2m4 ...
Xiang, Q., Haemers, W.H.
core  

On Almost Distance-Regular Graphs [PDF]

open access: yes
2010 Mathematics Subject Classification: 05E30, 05C50;distance-regular graph;walk-regular graph;eigenvalues;predistance ...
Fiol, M.A.   +4 more
core   +2 more sources

Uniformity in Association schemes and Coherent Configurations: Cometric Q-Antipodal Schemes and Linked Systems [PDF]

open access: yes
2010 Mathematics Subject Classification.
Dam, E.R. van   +2 more
core  

Graphs with Few Eigenvalues. An Interplay between Combinatorics and Algebra. [PDF]

open access: yes
: 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  

Strongly Regular Graphs from Weakly Regular Plateaued Functions

open access: yes, 2019
This paper presents the first construction of strongly regular graphs and association schemes from weakly regular plateaued functions over the finite fields of odd characteristic.
Mesnager, Sihem, Sinak, Ahmet
core   +1 more source

Strongly regular graphs induced by polarities of symmetric designs [PDF]

open access: yes
Graphs ...
Higman, D.G.   +2 more
core  

Universal Adjacency Matrices with Two Eigenvalues [PDF]

open access: yes
AMS Mathematics Subject Classification: 05C50.Adjacency matrix;Universal adjacency matrix;Laplacian matrix;signless Laplacian;Graph spectra;Eigenvalues;Strongly regular ...
Omidi, G.R., Haemers, W.H.
core  

Quantum-Like Dynamics in Whole-Brain Models of the Human Connectome. [PDF]

open access: yesAdv Sci (Weinh)
Deco G   +5 more
europepmc   +1 more source

Seidel-equivalence of strongly regular graphs

open access: yes, 1968
Seidel-equivalence of two strongly regular graphs G and G∗ with the same parameters is defined. Necessary conditions for the existence of partially balanced incomplete block designs with L2(4) and pseudo-T(8) association schemes are also obtained.
Shrikhande, S. S., Bhagawandas,
core   +1 more source

Home - About - Disclaimer - Privacy