Results 31 to 40 of about 38,730 (201)
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
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
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
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
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
The Strongly Regular $(45,12,3,3)$ Graphs [PDF]
The Electronic Journal of Combinatorics, 2006 Using two backtrack algorithms based on different techniques, designed and implemented independently, we were able to determine up to isomorphism all strongly regular graphs with parameters $v=45$, $k=12$, $\lambda=\mu=3$. It turns out that there are $78$ such graphs, having automorphism groups with sizes ranging from $1$ to $51840$.
Coolsaet, K., Degraer, J., Spence, E.
openaire +3 more sources
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
Discrete Mathematics, 1975 Translation from Discrete Math. 13, 357-381 (1975; Zbl 0311.05122).
openaire +4 more sources
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