Results 31 to 40 of about 3,100,536 (300)
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
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 +4 more sources
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
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
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
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
Discrete Mathematics, 1975 Translation from Discrete Math. 13, 357-381 (1975; Zbl 0311.05122).
openaire +6 more sources
Strongly Regular Graphs Having Strongly Regular Subconstituents
Journal of Algebra, 1978 No abstract.
Cameron, P.J. +2 more
openaire +2 more sources
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
The Extendability of Matchings in Strongly Regular Graphs [PDF]
The Electronic Journal of Combinatorics, 2014 A graph $G$ of even order $v$ is called $t$-extendable if it contains a perfect matching, $t<v/2$ and any matching of $t$ edges is contained in some perfect matching. The extendability of $G$ is the maximum $t$ such that $G$ is $t$-extendable. In this paper, we study the extendability properties of strongly regular graphs.
Sebastian M. Cioaba, Weiqiang Li 0002
openaire +2 more sources