Results 81 to 90 of about 29,931 (112)
Some of the next articles are maybe not open access.
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
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 signed graphs
Discrete Applied Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +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
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
A Note on Directed Strongly Regular Graphs
Graphs and Combinatorics, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
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
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
Strongly regular vertices and partially strongly regular graphs.
Ars Comb., 2004Summary: 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 +1 more source
On the (99,14,1,2) strongly regular graph
1984The 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