Results 31 to 40 of about 40,584 (295)
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
Directed Strongly Regular Cayley Graphs over Metacyclic Groups of Order 4n
Mathematics, 2019 We construct several new families of directed strongly regular Cayley graphs (DSRCGs) over the metacyclic group M 4 n = 〈 a , b | a n = b 4 = 1 , b − 1 a b = a − 1 〉 , some of which generalize those ...
Tao Cheng, Lihua Feng, Weijun Liu
doaj +1 more source
Generation of strongly regular graphs from quaternary complex Hadamard matrices
Ceylon Journal of Science, 2018 A strongly regular graph with parameters (v, k, μ, λ) is a regular graph G with v vertices and k degree in which every two adjacent vertices have λ common neighbors and every two non-adjacent vertices have μ common neighbors. In this paper, we propose an
W. V. Nishadi +3 more
doaj +1 more source
On the structure of compact graphs [PDF]
Opuscula Mathematica, 2017 A simple graph \(G\) is called a compact graph if \(G\) contains no isolated vertices and for each pair \(x\), \(y\) of non-adjacent vertices of \(G\), there is a vertex \(z\) with \(N(x)\cup N(y)\subseteq N(z)\), where \(N(v)\) is the neighborhood of ...
Reza Nikandish, Farzad Shaveisi
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
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
D-magic strongly regular graphs
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 +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
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