Results 21 to 30 of about 38,730 (201)

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, Alexander A. Makhnev   +1 more
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, R. Sundareswaran, G. Balaraman, P K Kishore Kumar, Said Broumi   +4 more
doaj   +1 more source

4-REGULAR GRAPH OF DIAMETER 2

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

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, Bernardo Amorim, Sophia Knight, Santiago Quintero, Frank Valencia   +4 more
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 Mathematics
The 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

Strongly regular graphs with strongly regular decomposition

Linear Algebra and its Applications, 1989
Partitions of strongly regular graphs into two strongly regular subgraphs are studied. Such partitions give rise to quasi-symmetric designs and other types of interesting configurations. Necessary conditions for the existence of such partitions are derived. Several constructions are given and a table of all feasible parameter sets up to 300 vertices is
Haemers, W. H., Higman, Donald G.
openaire   +2 more sources

Strongly Regular Semi-Cayley Graphs [PDF]

Journal of Algebraic Combinatorics, 1992
This paper studies strongly regular graphs \(G\) on \(2n\) vertices which admit a group of automorphisms \(\Gamma\) of order \(n\) with two orbits of length \(n\) on the vertices of \(G\), which are called semi-Cayley graphs. The Petersen and Hoffman-Singleton graphs provide examples.
de Resmini, Marialuisa J., Jungnickel, Dieter   +1 more
openaire   +3 more sources

Cyclotomy and Strongly Regular Graphs [PDF]

Journal of Algebraic Combinatorics, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brouwer, A. E., Wilson, R. M., Xiang, Qing   +2 more
openaire   +3 more sources

Extension of Strongly Regular Graphs [PDF]

The Electronic Journal of Combinatorics, 2008
The Friendship Theorem states that if any two people in a party have exactly one common friend, then there exists a politician who is a friend of everybody. In this paper, we generalize the Friendship Theorem. Let $\lambda$ be any nonnegative integer and $\mu$ be any positive integer.
Gera, Ralucca, Shen, J.
openaire   +4 more sources

5-chromatic strongly regular graphs [PDF]

Discrete Mathematics, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fiala, N.C., Haemers, W.H.
openaire   +4 more sources