Results 271 to 280 of about 2,975,002 (298)

Strongly Regular Graphs

2011
A graph (simple, undirected, and loopless) of order v is called strongly regular with parameters v, k,λ,μ whenever it is not complete or edgeless.
Andries E. Brouwer, Willem H. Haemers
openaire   +1 more source

A Note on Directed Strongly Regular Graphs

Graphs and Combinatorics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Strongly regular vertices and partially strongly regular graphs.

Ars Comb., 2004
Summary: A strongly regular vertex with parameters \((\lambda,\mu)\) in a graph is a vertex \(x\) such that the number of neighbors any other vertex \(y\) has in common with \(x\) is \(\lambda\) if \(y\) is adjacent to \(x\), and is \(\mu\) if \(y\) is not adjacent to \(x\).
openaire   +2 more sources

On the (99,14,1,2) strongly regular graph

1984
The existence of a strongly regular graph with parameters as in the title is still in doubt. It is proved that there is no such graph with an automorphism of order 11, and the only primes which could divide the order of the automorphism group of such a graph are 2, 3, 5 and 7.
openaire   +2 more sources

A walk-regular graph, cospectral to its complement, need not be strongly regular

Discrete Mathematics, 2023
Sanja Stevanovic
exaly  

Strongly regular graphs

1996
no abstract.
openaire   +2 more sources

Exponential Inequalities over the Parameters of a Strongly Regular Graph

Lecture Notes in Mechanical Engineering, 2022
Vasco Moco Mano
exaly  

Power Series and Inequalities on the Parameters of a Strongly Regular Graph

Lecture Notes in Mechanical Engineering, 2023
Vasco Mano, Luis de Almeida Vieira
exaly  

There is no (95, 40, 12, 20) strongly regular graph

Journal of Combinatorial Designs, 2020
Jernej Azarija, Tilen Marc
exaly  

On quasi-strongly regular graphs with parameters (n,k,a;k−1,c2)

Discrete Mathematics, 2021
Gengsheng Zhang
exaly