Results 31 to 40 of about 491,070 (354)
Switched graphs of some strongly regular graphs related to the symplectic graph [PDF]
Des. Codes Cryptogr., 2016 By applying a method of Godsil and McKay to some graphs related to the symplectic graph, two series of new infinite families of switched strongly regular graphs with parameters $$\big (2^n\pm 2^{\frac{n-1}{2}},2^{n-1}\pm 2^{\frac{n-1}{2}},2^{n-2} \pm 2^{\
Alice M. W. Hui, B. Rodrigues
semanticscholar +1 more source
A unique and novel graph matrix for efficient extraction of structural information of networks
Electronic Journal of Graph Theory and Applications, 2021 In this article, we propose a new type of square matrix associated with an undirected graph by trading off the natural embedded symmetry in them. The proposed matrix is defined using the neighbourhood sets of the vertices, called as neighbourhood matrix
Sivakumar Karunakaran +1 more
doaj +1 more source
AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {39; 36; 4; 1; 1; 36}
Ural Mathematical Journal, 2018 Makhnev and Nirova have found intersection arrays of distance-regular graphs with no more than \(4096\) vertices, in which \(\lambda=2\) and \(\mu=1\). They proposed the program of investigation of distance-regular graphs with \(\lambda=2\) and \(\mu=1\)
Konstantin S. Efimov +1 more
doaj +1 more source
Strongly Regular Graphs Having Strongly Regular Subconstituents
Journal of Algebra, 1978 No abstract.
Cameron, P.J. +2 more
openaire +2 more sources
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
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
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 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. +1 more
openaire +3 more sources