theor of graphs
Смотреть что такое "theor of graphs" в других словарях:
Event symmetry — The term Event symmetry describes invariance principles that have been used in some discrete approaches to quantum gravity where the diffeomorphism invariance of general relativity can be extended to a covariance under any permutation of… … Wikipedia
Tutte polynomial — This article is about the Tutte polynomial of a graph. For the Tutte polynomial of a matroid, see Matroid. The polynomial x4 + x3 + x2y is the Tutte polynomial of the Bull graph. The red line shows the intersection with the plane … Wikipedia
Dynkin diagram — See also: Coxeter–Dynkin diagram Finite Dynkin diagrams Affine (extended) Dynkin diagrams … Wikipedia
Complex network zeta function — Different definitions have been given for the dimension of a complex network or graph. For example, metric dimension is defined in terms of the resolving set for a graph. Dimension has also been defined based on the box covering method applied to … Wikipedia
Interval graph — In graph theory, an interval graph is the intersection graph of a set of intervals on the real line. It has one vertex for each interval in the set, and an edge between every pair of vertices corresponding to intervals that intersect.Formally,… … Wikipedia
Causal set theory bibliography — Main article: Causal Sets This Causal Set Theory Bibliography is intended to aid causal set research. It gathers together academic papers, books, talks and PhD theses related to causal set theory and is intended to help readers find references… … Wikipedia
Graphe d'intervalle — Sept intervalles de la droite réelle et le graphe d intervalle associé En théorie des graphes, un graphe d intervalle est le graphe d intersection (en) d … Wikipédia en Français
Combinatorics and physics — Combinatorial physics or physical combinatorics is the area of interaction between physics and combinatorics. Combinatorial Physics is an emerging area which unites combinatorial and discrete mathematical techniques applied to theoretical physics … Wikipedia
Butcher group — In mathematics, the Butcher group, named after the New Zealand mathematician John C. Butcher by Hairer Wanner (1974), is an infinite dimensional group first introduced in numerical analysis to study solutions of non linear ordinary differential… … Wikipedia
Peter Buneman — Infobox Scientist name = Peter Buneman image width = caption = birth date = birth place = death date = death place = residence = Edinburgh, United Kingdom citizenship = British nationality = British ethnicity = field = Computer Science work… … Wikipedia
Game complexity — Combinatorial game theory has several ways of measuring game complexity. This article describes five of them: state space complexity, game tree size, decision complexity, game tree complexity, and computational complexity. Contents 1 Measures of… … Wikipedia
