Results 271 to 280 of about 3,100,536 (300)
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.
Gengsheng Zhang
exaly +3 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
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 +2 more sources
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
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
A Note on Directed Strongly Regular Graphs
Graphs and Combinatorics, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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 +2 more sources