Results 21 to 30 of about 29,610 (306)
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
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
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
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
Fast Symbolic Algorithms for Omega-Regular Games under Strong Transition Fairness [PDF]
TheoretiCS, 2023 We consider fixpoint algorithms for two-player games on graphs with $\omega$-regular winning conditions, where the environment is constrained by a strong transition fairness assumption.
Tamajit Banerjee +4 more
doaj +1 more source
Cyclotomy and Strongly Regular Graphs [PDF]
Journal of Algebraic Combinatorics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brouwer, A. E. +2 more
openaire +3 more sources
Generation of strongly regular graphs from quaternary complex Hadamard matrices
Ceylon Journal of Science, 2018 A strongly regular graph with parameters (v, k, ΞΌ, Ξ») is a regular graph G with v vertices and k degree in which every two adjacent vertices have Ξ» common neighbors and every two non-adjacent vertices have ΞΌ common neighbors. In this paper, we propose an
W. V. Nishadi +3 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
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
Linear Codes from Two Weakly Regular Plateaued Balanced Functions
Entropy, 2023 Linear codes with a few weights have been extensively studied due to their wide applications in secret sharing schemes, strongly regular graphs, association schemes, and authentication codes.
Shudi Yang, Tonghui Zhang, Ping Li
doaj +1 more source