Strongly regular information

In mathematics, strongly regular might refer to: Strongly regular graph Strongly regular ring, or "strongly von Neumann regular" ring This disambiguation...

A strongly regular graph is a distance-regular graph with diameter 2 whenever μ is non-zero. It is a locally linear graph whenever λ = 1. A strongly regular...

that are regular but not strongly regular are the cycle graph and the circulant graph on 6 vertices. The complete graph Km is strongly regular for any...

von Neumann regular rings include unit regular rings and strongly von Neumann regular rings and rank rings. A ring R is called unit regular if for every...

A strongly regular graph is defined as follows. Let G = (V,E) be a regular graph with v vertices and degree k. G is said to be strongly regular if there...

construction forms a regular map and shows that the Petersen graph has non-orientable genus 1. The Petersen graph is strongly regular (with signature srg(10...

edge-transitive graphs, distance-transitive graphs, distance-regular graphs, and strongly regular graphs), and on the inclusion relationships between these...

of 3-regular triangle-free graphs, and the Cartesian products of smaller locally linear graphs. Certain Kneser graphs, and certain strongly regular graphs...

types of algorithms for matrix multiplication. The Games graph is a strongly regular graph with 729 vertices. Every edge belongs to a unique triangle, so...

exception of K8) as the strongly regular graphs with parameters srg(n(n – 1)/2, 2(n – 2), n – 2, 4). The three strongly regular graphs with the same parameters...

is a (−1, 1, 0)-adjacency matrix. This matrix is used in studying strongly regular graphs and two-graphs. The distance matrix has in position (i, j) the...

graph Wagner graph Wells graph Wiener–Araya graph Windmill graph The strongly regular graph on v vertices and rank k is usually denoted srg(v,k,λ,μ). Clebsch...

if it is a regular strong limit cardinal (this is equivalent to the definition given above). Some authors do not require weakly and strongly inaccessible...

theorem, a slightly weaker bound 2O(√n log2 n) was obtained first for strongly regular graphs by László Babai (1980), and then extended to general graphs...

xk (mod q), where k is any nonresidue mod q (Sachs 1962). Paley graphs are strongly regular graphs, with parameters s r g ( q , 1 2 ( q − 1 ) , 1 4 ( q − 5 ) ...

multiple mixing problem – are all strongly mixing systems also strongly 3-mixing? Weinstein conjecture – does a regular compact contact type level set of...

theory Perfect graph Quantum graph Random regular graphs Semantic networks Spectral graph theory Strongly regular graphs Symmetric graphs Transitive reduction...

These characters appear in the American animated television series Regular Show, created by J. G. Quintel for Cartoon Network. The series revolves around...

invented the notions of partial geometry, association scheme, and strongly regular graph and started a systematic study of difference sets to construct...

free group has no relations, the Cayley graph has no cycles: it is the 4-regular infinite tree. It is a key ingredient in the proof of the Banach–Tarski...

formal language theory, a regular language (also called a rational language) is a formal language that can be defined by a regular expression, in the strict...

10-regular Clebsch graph, is therefore also a strongly regular graph, with parameters ( 16 , 10 , 6 , 6 ) {\displaystyle (16,10,6,6)} . The 5-regular Clebsch...

Bron–Kerbosch algorithm for finding these sets. Several important strongly regular graphs also have a number of vertices that is a power of three, including...