Results 261 to 270 of about 2,798,542 (296)
Approximately strongly regular graphs
Discrete Mathematics, 2023 We give variants of the Krein bound and the absolute bound for graphs with a spectrum similar to that of a strongly regular graph. In particular, we investigate what we call approximately strongly regular graphs. We apply our results to extremal problems. Among other things, we show the following: (1) Caps in $\mathrm{PG}(n, q)$ for which the number of
Ferdinand Ihringer
exaly +5 more sources
Strongly walk-regular graphs [PDF]
Journal of Combinatorial Theory - Series A, 2013 We study a generalization of strongly regular graphs. We call a graph strongly walk-regular if there is an $\ell >1$ such that the number of walks of length $\ell$ from a vertex to another vertex depends only on whether the two vertices are the same, adjacent, or not adjacent. We will show that a strongly walk-regular graph must be an empty graph, a
G R Omidi, E R van Dam
exaly +4 more sources
Hemisystems and strongly regular graphs
Discrete Applied MathematicsIn a recent paper, it was constructed a family of hemisystems of H(3,p2), for every prime p of the form p=1+4a2, stabilised by PSL(2,p)×C[Formula presented]. In the case p=5, the full automorphism group is 3.A7, and the hemisystem is isomorphic to a sporadic one described by A. Cossidente and T. Penttila in 2005.
Vincenzo Pallozzi Lavorante +1 more
exaly +2 more sources
5-chromatic strongly regular graphs [PDF]
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Willem Haemers
exaly +5 more sources
Spreads in strongly regular graphs [PDF]
Designs, Codes, and Cryptography, 1996 Willem Haemers, Vladimir Tonchev
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On Generalized Strongly Regular Graphs
Graphs and Combinatorics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dongdong Jia +2 more
openaire +2 more sources
Non-existence of directed strongly regular graphs [PDF]
Discrete Mathematics, 2003 Directed strongly regular graphs were introduced by Duval in 1988. We give several non-existence results, each excluding infinite series of feasible parameter sets: We prove a result that extends the absolute bound for strongly regular graphs, and we ...
Leif Jørgensen
exaly +2 more sources
A Generalization of Strongly Regular Graphs
Southeast Asian Bulletin of Mathematics, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deza, Michel, Huang, Tayuan
openaire +2 more sources
Random strongly regular graphs? [PDF]
Discrete Mathematics, 2003 Strongly regular graphs lie on the cusp between highly structured and unstructured. For example, there is a unique strongly regular graph with parameters (36,10,4,2), but there are 32548 non-isomorphic graphs with parameters (36,15,6,6).
Peter Cameron
exaly +2 more sources