Results 311 to 320 of about 491,070 (354)
Some of the next articles are maybe not open access.
Strongly Regular Graphs Satisfying the 4-Vertex Condition
Combinatorica, 2021We survey the area of strongly regular graphs satisfying the 4-vertex condition and find several new families. We describe a switching operation on collinearity graphs of polar spaces that produces cospectral graphs.
A. Brouwer, F. Ihringer, W. Kantor
semanticscholar +1 more source
2022
Strongly regular graphs lie at the intersection of statistical design, group theory, finite geometry, information and coding theory, and extremal combinatorics. This monograph collects all the major known results together for the first time in book form, creating an invaluable text that researchers in algebraic combinatorics and related areas will ...
Andries E. Brouwer, H. Van Maldeghem
openaire +1 more source
Strongly regular graphs lie at the intersection of statistical design, group theory, finite geometry, information and coding theory, and extremal combinatorics. This monograph collects all the major known results together for the first time in book form, creating an invaluable text that researchers in algebraic combinatorics and related areas will ...
Andries E. Brouwer, H. Van Maldeghem
openaire +1 more source
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 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
On Generalized Strongly Regular Graphs
Graphs and Combinatorics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jia, Dongdong +2 more
openaire +2 more sources
2001
In this chapter we return to the theme of combinatorial regularity with the study of strongly regular graphs. In addition to being regular, a strongly regular graph has the property that the number of common neighbours of two distinct vertices depends only on whether they are adjacent or nonadjacent.
Chris Godsil, Gordon Royle
openaire +1 more source
In this chapter we return to the theme of combinatorial regularity with the study of strongly regular graphs. In addition to being regular, a strongly regular graph has the property that the number of common neighbours of two distinct vertices depends only on whether they are adjacent or nonadjacent.
Chris Godsil, Gordon Royle
openaire +1 more source
Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique
Designs, Codes and Cryptography, 2023A. L. Gavrilyuk, Vladislav V. Kabanov
semanticscholar +1 more source
Regular two-graphs from strongly regular graphs
2022In this talk we will give a classification of strongly regular graphs with parameters (41, 20, 9, 10) that have a nontrivial automorphism. We will talk about the construction of regular two-graphs with 42 vertices from these strongly regular graphs and about the construction of regular two-graphs with 38 vertices.
Maksimović, Marija, Rukavina, Sanja
openaire
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
On strongly regular self ‐ complementary graphs
Journal of Graph Theory, 1981AbstractIt is shown that certain conditions assumed on a regular self‐complementary graph are not sufficient for the graph to be strongly regular, answering in the negative a question posed by Kotzig in [1].
openaire +1 more source