Results 51 to 60 of about 491,070 (354)
On strictly Deza graphs with parameters (n,k,k-1,a) [PDF]
, 2018 A nonempty $k$-regular graph $\Gamma$ on $n$ vertices is called a Deza graph if there exist constants $b$ and $a$ $(b \geq a)$ such that any pair of distinct vertices of $\Gamma$ has precisely either $b$ or $a$ common neighbours. The quantities $n$, $k$,
Kabanov, V. V. +2 more
core +1 more source
Discrete Mathematics, 1975 Translation from Discrete Math. 13, 357-381 (1975; Zbl 0311.05122).
openaire +4 more sources
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
Automorphism groups of the constituent graphs of integral distance graphs
AKCE International Journal of Graphs and Combinatorics, 2023 In this paper, we consider the automorphism groups of Cayley graphs which are a basis of a complete Boolean algebra of strongly regular graphs, one of such graph is the integral distance graph [Formula: see text] The automorphism groups of the integral ...
O. Habineza, E. Mwambene
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
Another construction of edge-regular graphs with regular cliques
, 2018 We exhibit a new construction of edge-regular graphs with regular cliques that are not strongly regular. The infinite family of graphs resulting from this construction includes an edge-regular graph with parameters $(24,8,2)$.
Greaves, Gary R. W., Koolen, J. H.
core +1 more source
Strongly Regular Graphs from Weakly Regular Plateaued Functions [PDF]
2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA), 2019 The paper provides the first constructions of strongly regular graphs and association schemes from weakly regular plateaued functions over finite fields of odd characteristic. We generalize the construction method of strongly regular graphs from weakly regular bent functions given by Chee et al.
Mesnager, Sihem, Sinak, Ahmet
openaire +3 more sources
Bordered Complex Hadamard Matrices and Strongly Regular Graphs [PDF]
, 2020 We consider bordered complex Hadamard matrices whose core is contained in the Bose-Mesner algebra of a strongly regular graph. Examples include a Butson-type complex Hadamard matrix whose core is contained in the Bose-Mesner algebra of a conference graph
Takuya Ikuta, A. Munemasa
semanticscholar +1 more source
On the construction and comparison of graph irregularity indices [PDF]
Kragujevac Journal of Science, 2017 Irregularity indices are generally used for quantitative characterization of topological structure of non-regular graphs. According to a widely accepted preconception, using a topological invariant (called a graph irregularity index) for that purpose ...
Réti Tamás, Tóth-Laufer Edit
doaj +1 more source
Some new models for multiprocessor interconnection networks [PDF]
Yugoslav Journal of Operations Research, 2016 A multiprocessor system can be modeled by a graph G. The vertices of G correspond to processors while edges represent links between processors. To find suitable models for multiprocessor interconnection networks (briefly MINs), one can apply ...
Cvetković Dragoš +2 more
doaj +1 more source