The lower bound for number of hexagons in strongly regular graphs with parameters $\lambda=1$ and $\mu=2$ [PDF]
E-Journal of Analysis and Applied MathematicsThe existence of $srg(99,14,1,2)$ has been a question of interest for several decades to the moment. In this paper, we consider the structural properties in general for the family of strongly regular graphs with parameters $\lambda =1$ and $\mu =2$.
Reimbay Reimbayev
doaj +3 more sources
Non-existence of (76,30,8,14) strongly regular graph [PDF]
, 2017 We prove the non-existence of strongly regular graph with parameters $(76,30,8,14)$. We use Euclidean representation of a strongly regular graph together with a new lower bound on the number of 4-cliques to derive strong structural properties of the ...
Bondarenko, A. V. +2 more
core +2 more sources
Euclidean Jordan algebras and some conditions over the spectra of a strongly regular graph
4 open, 2019 Let G be a primitive strongly regular graph G such that the regularity is less than half of the order of G and A its matrix of adjacency, and let 𝒜 be the real Euclidean Jordan algebra of real symmetric matrices of order n spanned by the identity matrix ...
Vieira Luís
doaj +2 more sources
On the Complexity of Identifying Strongly Regular Graphs [PDF]
The Australasian Journal of Combinatorics, 2022 In this paper, we show that Graph Isomorphism (GI) is not $\textsf{AC}^{0}$-reducible to several problems, including the Latin Square Isotopy problem, isomorphism testing of several families of Steiner designs, and isomorphism testing of conference ...
Michael Levet
openalex +3 more sources
There Does Not Exist a Strongly Regular Graph with Parameters $(1911, 270, 105, 27)$ [PDF]
Electronic Journal of Combinatorics, 2021 In this paper we show that there does not exist a strongly regular graph with parameters $(1911, 270, 105, 27)$.
J. Koolen, Brhane Gebremichel
semanticscholar +1 more source
A New Construction of Strongly Regular Graphs with Parameters of the Complement Symplectic Graph [PDF]
Electronic Journal of Combinatorics, 2022 The symplectic graph Sp(2d, q) is the collinearity graph of the symplectic space of dimension 2d over a finite field of order q. A k-regular graph on v vertices is a divisible design graph with parameters (v, k, lambda_1, lambda_2 ,m,n) if its vertex set
V. Kabanov
semanticscholar +1 more source
Investigation graph isomorphism problem via entanglement entropy in strongly regular graphs [PDF]
, 2015 We investigate the quantum networks that their nodes are considered as quantum harmonic oscillators. The entanglement of the ground state can be used to quantify the amount of information one part of a network shares with the other part of the system ...
M. A. Jafarizadeh +2 more
openalex +3 more sources
On r-Edge Regular Neutrosophic Graphs [PDF]
Neutrosophic Sets and Systems, 2023 We approach learning characteristic on a neutrosophic graph such as r-edge regular neutrosophic graph, strongly edge regular neutrosophic graph and absolute degree of vertex since a neutrosophic set 𝑁𝑆 = {〈𝑥, 𝑁𝑆𝔗(𝑥), 𝑁𝑆𝔩 (𝑥), 𝑁𝑆𝔉(𝑥)〉; 𝑥 ∈ 𝑋} of a ...
M. Kaviyarasu
doaj +1 more source
An upper bound for difference of energies of a graph and its complement
Examples and Counterexamples, 2023 The A-energy of a graph G, denoted by EA(G), is defined as sum of the absolute values of eigenvalues of adjacency matrix of G. Nikiforov in Nikiforov (2016) proved that EA(G¯)−EA(G)≤2μ¯1and EA(G)−EA(G¯)≤2μ1for any graph G and posed a problem to find best
Harishchandra S. Ramane +2 more
doaj +1 more source
On complementary equienergetic strongly regular graphs [PDF]
Discrete Mathematics Letters, 2020 Harishchandra S. Ramane +4 more
doaj +1 more source