Results 21 to 30 of about 40,584 (295)
AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {25; 16; 1; 1; 8; 25}
Ural Mathematical Journal, 2017 Makhnev and Samoilenko have found parameters of strongly regular graphs with no more than 1000 vertices, which may be neighborhoods of vertices in antipodal distance-regular graph of diameter 3 and with \(\lambda=\mu\).
Konstantin S. Efimov +1 more
doaj +1 more source
The Connectivity of Strongly Regular Graphs
European Journal of Combinatorics, 1985 Es wird bewiesen, daß in einem streng regulären Graphen jede kleinste trennende Eckenmenge aus den Nachbarn einer Ecke bestehen muß.
A.E. Brouwer (Andries), D.M. Mesner
openaire +4 more sources
Tạp chí Khoa học Đại học Đà Lạt, 2013 A regular graph is a graph where each vertex has the same degree. A regular graph with vertices of degree k is called a k -regular graph or regular graph of degree k.
Đỗ Như An, Nguyễn Đình Ái
doaj +1 more source
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 +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 φ
openaire +3 more sources
Approximately strongly regular graphs
Discrete Mathematics, 2023 We give variants of the Krein bound and the absolute bound for graphs with a spectrum similar to that of a strongly regular graph. In particular, we investigate what we call approximately strongly regular graphs. We apply our results to extremal problems. Among other things, we show the following: (1) Caps in $\mathrm{PG}(n, q)$ for which the number of
openaire +3 more sources
Vulnerability Parameters in Neutrosophic Graphs [PDF]
Neutrosophic Sets and Systems, 2022 Let 𝐺 = (U, V) be a Single valued Neutrosophic graph. A subset 𝑆 ∈ 𝑈(𝐺) is a said to be score equitable set if the score value of any two nodes in S differ by at most one. That is, |𝑠(𝑢)– 𝑠(𝑣)| ≤ 1, 𝑢, 𝑣 ∊ 𝑆. If e is an edge with end vertices u and v and
R.V. Jaikumar +4 more
doaj +1 more source
A Formal Model for Polarization under Confirmation Bias in Social Networks [PDF]
Logical Methods in Computer Science, 2023 We describe a model for polarization in multi-agent systems based on Esteban and Ray's standard family of polarization measures from economics. Agents evolve by updating their beliefs (opinions) based on an underlying influence graph, as in the standard ...
Mário S. Alvim +4 more
doaj +1 more source
Strongly walk-regular graphs [PDF]
Journal of Combinatorial Theory, Series A, 2013 We study a generalization of strongly regular graphs. We call a graph strongly walk-regular if there is an $\ell >1$ such that the number of walks of length $\ell$ from a vertex to another vertex depends only on whether the two vertices are the same, adjacent, or not adjacent. We will show that a strongly walk-regular graph must be an empty graph, a
Edwin R. van Dam, G. R. Omidi
openaire +3 more sources
Discrete Mathematics, 1975 Translation from Discrete Math. 13, 357-381 (1975; Zbl 0311.05122).
openaire +5 more sources