strongly regular
Смотреть что такое "strongly regular" в других словарях:
Strongly regular graph — Let G = (V,E) be a regular graph with v vertices and degree k . G is said to be strongly regular if there are also integers λ and μ such that:* Every two adjacent vertices have λ common neighbours.* Every two non adjacent vertices have μ common… … Wikipedia
Regular graph — In graph theory, a regular graph is a graph where each vertex has the same number of neighbors, i.e. every vertex has the same degree or valency. A regular graph with vertices of degree k is called a kregular graph or regular graph of degree… … Wikipedia
Strongly compact cardinal — In mathematical set theory, a strongly compact cardinal is a certain kind of large cardinal number; their existence can neither be proven nor disproven from the standard axioms of set theory.A cardinal kappa; is strongly compact if and only if… … Wikipedia
Distance-regular graph — Graph families defined by their automorphisms distance transitive distance regular strongly regular … Wikipedia
Grafo regular — En Teoría de grafos, un Grafo regular es un grafo donde cada vértice tiene el mismo grado o valencia. Un Grafo regular con vértices de grado k es llamado Grafo k regular o Grafo regular de grado k. Los Grafos regulares de grado hasta 2 son… … Wikipedia Español
Von Neumann regular ring — In mathematics, a ring R is von Neumann regular if for every a in R there exists an x in R with : a = axa .One may think of x as a weak inverse of a ; note however that in general x is not uniquely determined by a .(The regular local rings of… … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… … Universalium
Clebsch graph — Named after Alfred Clebsch Vertices 16 Edges 40 … Wikipedia
Регулярный граф — граф, степени всех вершин которого равны, то есть каждая вершина имеет одинаковое количество соседей. Степень регулярности является инвариантом графа и обозначается . Для нерегулярных графов не определено. Регулярные графы представляют особую… … Википедия
Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges … Wikipedia
