Results 21 to 30 of about 28,901 (265)
AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {25; 16; 1; 1; 8; 25}
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
Fast Symbolic Algorithms for Omega-Regular Games under Strong Transition Fairness [PDF]
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
Directed Strongly Regular Cayley Graphs over Metacyclic Groups of Order 4n
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
A Formal Model for Polarization under Confirmation Bias in Social Networks [PDF]
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
On Automorphisms of a Distance-Regular Graph with Intersection Array {125,96,1;1,48,125} [PDF]
J. Koolen posed the problem of studying distance-regular graphs in which neighborhoods of vertices are strongly regular graphs with the second eigenvalue ≤ t for the given positive integer t.
V.V. Bitkina, A.A. Makhnev
doaj
Linear Codes from Two Weakly Regular Plateaued Balanced Functions
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
On the construction and comparison of graph irregularity indices [PDF]
Irregularity indices are generally used for quantitative characterization of topological structure of non-regular graphs. According to a widely accepted preconception, using a topological invariant (called a graph irregularity index) for that purpose ...
Réti Tamás, Tóth-Laufer Edit
doaj +1 more source
Automorphism groups of the constituent graphs of integral distance graphs
In this paper, we consider the automorphism groups of Cayley graphs which are a basis of a complete Boolean algebra of strongly regular graphs, one of such graph is the integral distance graph [Formula: see text] The automorphism groups of the integral ...
O. Habineza, E. Mwambene
doaj +1 more source
On the structure of compact graphs [PDF]
A simple graph \(G\) is called a compact graph if \(G\) contains no isolated vertices and for each pair \(x\), \(y\) of non-adjacent vertices of \(G\), there is a vertex \(z\) with \(N(x)\cup N(y)\subseteq N(z)\), where \(N(v)\) is the neighborhood of ...
Reza Nikandish, Farzad Shaveisi
doaj +1 more source
On Strongly Regular Graphs and the Friendship Theorem
This paper presents an alternative proof of the celebrated friendship theorem, originally established by Erdős, Rényi, and Sós in 1966. The proof relies on a closed-form expression for the Lovász ϑ-function of strongly regular graphs, recently derived by
Igal Sason
doaj +1 more source

