Results 31 to 40 of about 2,911,408 (294)
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
Approximately strongly regular graphs
Discrete Mathematics, 2023 We give variants of the Krein bound and the absolute bound for graphs with a spectrum similar to that of a strongly regular graph. In particular, we investigate what we call approximately strongly regular graphs. We apply our results to extremal problems. Among other things, we show the following: (1) Caps in $\mathrm{PG}(n, q)$ for which the number of
openaire +4 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.
Brouwer, A.E., Haemers, W.H.
openaire +5 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 φ
openaire +3 more sources
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
Certain Concepts in Vague Graph with an Application
Discrete Dynamics in Nature and Society, 2022 Vague graphs (VGs), belonging to the FGs family, have good capabilities when faced with problems that cannot be expressed by FGs. When an element’s membership is not clear, neutrality is a good option that can be well-supported by a VG.
Xiaolong Shi +3 more
doaj +1 more source
Graph isomorphism and Gaussian boson sampling
Special Matrices, 2021 We introduce a connection between a near-term quantum computing device, specifically a Gaussian boson sampler, and the graph isomorphism problem. We propose a scheme where graphs are encoded into quantum states of light, whose properties are then probed ...
Brádler Kamil +4 more
doaj +1 more source
Transitive $t$-designs and strongly regular graphs constructed from linear groups $L(2,q)$, $q leq 23$ [PDF]
International Journal of Group Theory, 2019 In this paper we construct transitive $t$-designs from the linear groups $L(2,q), q leq 23$. Thereby we classify $t$-designs, $t ge 2$, admitting a transitive action of the linear groups $L(2,q), q leq 23$, up to 35 points and obtained ...
Dean Crnković, Andrea Švob
doaj +1 more source
Observations on the Lovász θ-Function, Graph Capacity, Eigenvalues, and Strong Products
Entropy, 2023 This paper provides new observations on the Lovász θ-function of graphs. These include a simple closed-form expression of that function for all strongly regular graphs, together with upper and lower bounds on that function for all regular graphs.
Igal Sason
doaj +1 more source
Maximal Product of Graphs under Vague Environment
Mathematical and Computational Applications, 2020 Graph models are found everywhere in natural and human made structures, including process dynamics in physical, biological and social systems. The product of graphs are appropriately used in several combinatorial applications and in the formation of ...
Behnaz Sheikh Hoseini +4 more
doaj +1 more source