Results 11 to 20 of about 11,145,283 (118)
Regular star complements in strongly regular graphs [PDF]
, 2012 We prove that, aside from the complete multipartite graphs and graphs of Steiner type, there are only finitely many connected strongly regular graphs with a regular star complement of prescribed degree s∈N.
Peter Rowlinson, Rowlinson, Peter
core +1 more source
PARTITIONING STRONGLY REGULAR GRAPHS (BALANCED INCOMPLETE BLOCK DESIGNS, ASSOCIATION SCHEMES).
, 1984 A strongly regular graph can be design partitioned if the vertices of the graph can be partitioned into two sets V and B such that V is a coclique and every vertex in B is adjacent to the same number of vertices in V.
GOSSETT, ERIC JAMES.
core +5 more sources
Some Implications on Amorphic Association Schemes [PDF]
AMS classifications: 05E30, 05B20;amorphic association scheme;strongly regular graph;(negative) Latin square type;cyclotomic association scheme;strongly regular ...
Dam, E.R. van, Muzychuk, M.
core +2 more sources
Regular graphs with four eigenvalues [PDF]
We study the connected regular graphs with four distinct eigenvalues. Properties and feasibility conditions of the eigenvalues are found. Several examples, constructions and characterizations are given, as well as some uniqueness and nonexistence results.
Dam, E.R. van
core +2 more sources
Quadrance polygons, association schemes and strongly regular graphs
, 2005 15 pages ...
openaire +2 more sources
Directed strongly regular graphs and divisible design graphs from Tatra association schemes
22 ...
Muzychuk, Mikhail, Ryabov, Grigory
openaire +2 more sources
Developments on Spectral Characterizations of Graphs [PDF]
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are determined by the spectrum of some matrix associated to the graph.
Dam, E.R. van, Haemers, W.H.
core +2 more sources
Hamiltonian Strongly Regular Graphs [PDF]
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected non-Hamiltonian strongly regular graph on fewer than 99 vertices.Distance-regular graphs;Hamilton cycles JEL ...
Brouwer, A.E., Haemers, W.H.
core
Spreads in strongly regular graphs [PDF]
, 1995 A spread of a strongly regular graph is a partition of the vertex set into cliques that meet Delsarte's bound (also called Hoffman's bound). Such spreads give rise to colorings meeting Hoffman's lower bound for the chromatic number and to ...
Touchev, V.D. +9 more
core +3 more sources
Strongly Regular Graphs with Maximal Energy [PDF]
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Koolen and Moulton have proved that the energy of a graph on n vertices is at most n(1 + √n)/2, and that equality holds if and only if the graph is ...
Haemers, W.H.
core