Results 261 to 270 of about 40,584 (295)
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.
Gengsheng Zhang, Zhang Gengsheng
exaly +3 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 +2 more sources
Feasibility Conditions on the Parameters of a Strongly Regular Graph [PDF]
Electronic Notes in Discrete Mathematics, 2011 We consider a strongly regular graph, G, and associate a three dimensional Euclidean Jordan algebra, V, to the adjacency matrix A of G. Then, by considering convergent series of Hadamard powers of the idempotents of the unique complete system of ...
Vasco Moco Mano +2 more
exaly +2 more sources
On automorphisms of a strongly regular graph with parameters (210,95,40,45)
Proceedings of the Steklov Institute of Mathematics, 2012 Possible orders of automorphisms of a strongly regular graph with parameters (210,95,40,45) and the structure of fixed-point subgraphs of these automorphisms are found.
Makhnev A A
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
On strongly regular signed graphs
Discrete Applied Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Strongly regular graphs decomposable into a divisible design graph and a Delsarte clique
Designs, Codes, and CryptographyDivisible design graph; Strongly regular ...
Alexander L Gavrilyuk, V V Kabanov
exaly +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
A Note on Directed Strongly Regular Graphs
Graphs and Combinatorics, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source