Find link

language:

Find link is a tool written by Edward Betts.

searching for Covering graph 12 found (25 total)

Dedekind–MacNeille completion (2,726 words) [view diff] exact match in snippet view article find links to article

to compute this covering graph efficiently; more generally, if B is any family of sets, they show how to compute the covering graph of the lattice of

Bidirected graph (347 words) [view diff] exact match in snippet view article find links to article

may be called ordinary edges. A skew-symmetric graph is the double covering graph of a bidirected graph. A bidirected graph may be regarded as an orientation

Periodic graph (geometry) (2,096 words) [view diff] exact match in snippet view article

a periodic Euclidean graph is a periodic realization of an abelian covering graph over a finite graph. A Euclidean graph is uniformly discrete if there

Nielsen–Schreier theorem (1,691 words) [view diff] exact match in snippet view article find links to article

rank of H. Applying the two properties of Euler characteristic for the covering graph Y corresponding to H gives the following: χ ( Y ) = 1 − r {\displaystyle

Skew-symmetric graph (2,318 words) [view diff] exact match in snippet view article find links to article

cycle. A skew-symmetric graph may equivalently be defined as the double covering graph of a polar graph or switch graph, which is an undirected graph in which

Line graph (5,360 words) [view diff] exact match in snippet view article find links to article

construction before this. Other terms used for the line graph include the covering graph, the derivative, the edge-to-vertex dual, the conjugate, the representative

Periodic graph (crystallography) (2,541 words) [view diff] exact match in snippet view article

(actually a crystal net is nothing but a periodic realization of an abelian covering graph over a finite graph ), and is closely related to that of a Tessellation

Hasse diagram (1,342 words) [view diff] exact match in snippet view article find links to article

order can be drawn as a Hasse diagram in which no two edges cross, its covering graph is said to be upward planar. A number of results on upward planarity

Unique games conjecture (3,066 words) [view diff] exact match in snippet view article find links to article

that unique label cover is an instance of the Maximum Section of a Covering Graph problem (covering graphs is the terminology from topology; in the context

Central limit theorem (9,171 words) [view diff] exact match in snippet view article find links to article

the simple random walk on a crystal lattice (an infinite-fold abelian covering graph over a finite graph), and is used for design of crystal structures.

Percolation threshold (15,626 words) [view diff] exact match in snippet view article find links to article

388(5) 0.390(11) diamond dual 6 2⁄3 0.3904(5) 0.2350(5) 3D kagome (covering graph of the diamond lattice) 6 π √2 / 12 = 0.37024 0.1442 0.3895(2) =pc(site)

Italo Jose Dejter (5,660 words) [view diff] exact match in snippet view article find links to article

group, which happens to be bipartite; Dejter also showed that an i-covering graph of Kn is hamiltonian, for i less than 4, and that properly minimal connected