Results 11 to 20 of about 29,931 (112)
The Connectivity of Strongly Regular Graphs
European Journal of Combinatorics, 1985 Es wird bewiesen, daß in einem streng regulären Graphen jede kleinste trennende Eckenmenge aus den Nachbarn einer Ecke bestehen muß.
A.E. Brouwer (Andries), D.M. Mesner
openaire +4 more sources
Discrete Mathematics, 1975 Translation from Discrete Math. 13, 357-381 (1975; Zbl 0311.05122).
openaire +5 more sources
Strongly Regular Graphs Having Strongly Regular Subconstituents
Journal of Algebra, 1978 No abstract.
Cameron, P.J. +2 more
openaire +2 more sources
The Extendability of Matchings in Strongly Regular Graphs [PDF]
The Electronic Journal of Combinatorics, 2014 A graph $G$ of even order $v$ is called $t$-extendable if it contains a perfect matching, $t<v/2$ and any matching of $t$ edges is contained in some perfect matching. The extendability of $G$ is the maximum $t$ such that $G$ is $t$-extendable. In this paper, we study the extendability properties of strongly regular graphs.
Sebastian M. Cioaba, Weiqiang Li 0002
openaire +2 more sources
Journal of Combinatorial Theory, Series A, 1985 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rudolf Mathon, Alexander Rosa
openaire +2 more sources
Disconnecting strongly regular graphs
European Journal of Combinatorics, 2014 In this paper, we show that the minimum number of vertices whose removal disconnects a connected strongly regular graph into non-singleton components, equals the size of the neighborhood of an edge for many graphs. These include blocks graphs of Steiner $2$-designs, many Latin square graphs and strongly regular graphs whose intersection parameters are ...
Sebastian M. Cioaba +2 more
openaire +2 more sources
On the Clique Number of a Strongly Regular Graph [PDF]
The Electronic Journal of Combinatorics, 2018 We determine new upper bounds for the clique numbers of strongly regular graphs in terms of their parameters. These bounds improve on the Delsarte bound for infinitely many feasible parameter tuples for strongly regular graphs, including infinitely many parameter tuples that correspond to Paley graphs.
Gary R. W. Greaves, Leonard H. Soicher
openaire +4 more sources
Strongly regular graphs with strongly regular decomposition
Linear Algebra and its Applications, 1989 Partitions of strongly regular graphs into two strongly regular subgraphs are studied. Such partitions give rise to quasi-symmetric designs and other types of interesting configurations. Necessary conditions for the existence of such partitions are derived. Several constructions are given and a table of all feasible parameter sets up to 300 vertices is
Haemers, W. H., Higman, Donald G.
openaire +2 more sources
Switching for Small Strongly Regular Graphs [PDF]
Australas. J Comb., 2020 21 pages; accepted version, 26 Tables, 1 ...
openaire +4 more sources
Binary Codes of Strongly Regular Graphs [PDF]
Designs, Codes and Cryptography, 1999 The binary code of a graph is the linear code generated by the rows of the adjacency matrix of the graph. The authors investigate, with the exception of two parameter sets, the codes from known strongly regular graphs with fewer than 45 vertices. They also consider the codes obtained when the main diagonal of the adjacency matrix is the all-one vector.
Haemers, W.H. +2 more
openaire +5 more sources