Results 1 to 10 of about 286,497 (273)
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 ...
Abreu +15 more
core +7 more sources
Hamiltonian Strongly Regular Graphs [PDF]
SSRN Electronic Journal, 2008 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 +7 more sources
D-magic strongly regular graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 For a set of distances D, a graph G on n vertices is said to be D-magic if there exists a bijection and a constant k such that for any vertex x, where is the D-neighbourhood set of x.
Rinovia Simanjuntak, Palton Anuwiksa
doaj +3 more sources
Homomorphisms of Strongly Regular Graphs [PDF]
Algebraic Combinatorics, 2016 We prove that if $G$ and $H$ are primitive strongly regular graphs with the same parameters and $\varphi$ is a homomorphism from $G$ to $H$, then $\varphi$ is either an isomorphism or a coloring (homomorphism to a complete subgraph).
Roberson, David E.
core +4 more sources
On highly regular strongly regular graphs [PDF]
Algebraic Combinatorics, 2020 In this paper we unify several existing regularity conditions for graphs, including strong regularity, $k$-isoregularity, and the $t$-vertex condition. We develop an algebraic composition/decomposition theory of regularity conditions.
Pech, Christian
core +5 more sources
Strongly regular graphs from weakly regular plateaued functions [PDF]
2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA), 2018 The paper provides the first constructions of strongly regular graphs and association schemes from weakly regular plateaued functions over finite fields of odd characteristic.
Mesnager, Sihem, Sınak, Ahmet
core +5 more sources
The strongly regular (45,12,3,3) graphs [PDF]
The Electronic Journal of Combinatorics, 2006 Using two backtrack algorithms based on dierent techniques, designed and implemented independently, we were able to determine up to isomorphism all strongly regular graphs with parameters v = 45, k = 12, λ = μ = 3.
Coolsaet, K., Degraer, J., Spence, E.
core +5 more sources
5-Chromatic Strongly Regular Graphs [PDF]
Discrete Mathematics, 2006 In this paper, we begin the determination of all primitive strongly regular graphs with chromatic number equal to 5.Using eigenvalue techniques, we show that there are at most 43 possible parameter sets for such a graph.For each parameter set, we must ...
Fiala, N.C., Haemers, W.H.
core +6 more sources
Disconnecting strongly regular graphs [PDF]
European Journal of Combinatorics, 2013 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 $
Cioabă, Sebastian M. +2 more
core +2 more sources
Spreads in strongly regular graphs. [PDF]
Designs Codes and Cryptography, 1996 Haemers, W.H., Touchev, V.D.
core +4 more sources