Results 41 to 50 of about 38,730 (201)
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
Ural Mathematical JournalWe consider antipodal graphs \(\Gamma\) of diameter 4 for which \(\Gamma_{1,2}\) is a strongly regular graph. A.A. Makhnev and D.V. Paduchikh noticed that, in this case, \(\Delta=\Gamma_{3,4}\) is a strongly regular graph without triangles.
Alexander A. Makhnev +2 more
doaj +1 more source
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 +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
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 φ is a homomorphism from G to H, then φ is either an isomorphism or a coloring (homomorphism to a complete subgraph). Moreover, any such coloring is optimal for G and its image is a maximum clique of H.
openaire +4 more sources
On highly regular strongly regular graphs [PDF]
Algebraic Combinatorics, 2021 In this paper we unify several existing regularity conditions for graphs, including strong regularity, k-isoregularity, and the t-vertex condition. We develop an algebraic composition/decomposition theory of regularity conditions. Using our theoretical results we show that a family of non rank 3 graphs known to satisfy the 7-vertex condition fulfills ...
openaire +3 more sources
On Automorphisms of a Distance-Regular Graph with Intersection Array {125,96,1;1,48,125} [PDF]
Учёные записки Казанского университета: Серия Физико-математические науки, 2017 J. Koolen posed the problem of studying distance-regular graphs in which neighborhoods of vertices are strongly regular graphs with the second eigenvalue ≤ t for the given positive integer t.
V.V. Bitkina, A.A. Makhnev
doaj
Algorithms, 2019 A generalization of Ding’s construction is proposed that employs as a defining set the collection of the sth powers ( s ≥ 2 ) of all nonzero elements in G F ( p m ) , where p ≥ 2 is prime.
Dean Crnković +2 more
doaj +1 more source
More on Signed Graphs with at Most Three Eigenvalues
Discussiones Mathematicae Graph Theory, 2022 We consider signed graphs with just 2 or 3 distinct eigenvalues, in particular (i) those with at least one simple eigenvalue, and (ii) those with vertex-deleted subgraphs which themselves have at most 3 distinct eigenvalues.
Ramezani Farzaneh +2 more
doaj +1 more source
Rotation-based schedules in elementary schools to prevent COVID-19 spread: a simulation study
Scientific Reports, 2023 Rotations of schoolchildren were considered as a non-pharmacological intervention in the COVID-19 pandemic. This study investigates the impact of different rotation and testing schedules.We built an agent-based model of interactions among pupils and ...
Cyril Brom +10 more
doaj +1 more source