Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Distance-regular graph (view), Strongly regular graph (view), Random regular graph (view), Walk-regular graph (view), Highly irregular graph (view)

searching for Regular graph 26 found (179 total)

alternate case: regular graph

Alon–Boppana bound (1,908 words) [view diff] exact match in snippet view article find links to article

second-largest eigenvalue of the adjacency matrix of a d {\displaystyle d} -regular graph, meaning a graph in which every vertex has degree d {\displaystyle d}

Julius Petersen (1,478 words) [view diff] exact match in snippet view article find links to article

4-colour problem: a bridgeless 3-regular graph is factorable into three 1-factors and the theorem: ‘a connected 3-regular graph with at most two leaves contains

Rotation map (484 words) [view diff] exact match in snippet view article find links to article

the edge label that would lead back to v {\displaystyle v} . For a D-regular graph G, the rotation map R o t G : [ N ] × [ D ] → [ N ] × [ D ] {\displaystyle

Cyclic (mathematics) (261 words) [view diff] exact match in snippet view article

theory: Cyclic function, a periodic function Cycle graph, a connected, 2-regular graph Cycle graph (algebra), a diagram representing the cycles determined

Adjacent-vertex-distinguishing-total coloring (777 words) [view diff] exact match in snippet view article find links to article

algorithmic procedure that gives a 7-AVD-total-colouring for any 4-regular graph. Zhang 2005. Zhang 2005, p. 290. Zhang 2005, p. 299. Hulgan 2009, p

57-cell (334 words) [view diff] exact match in snippet view article find links to article

The vertices and edges form the Perkel graph, the unique distance-regular graph with intersection array {6,5,2;1,1,3}, discovered by Manley Perkel (1979)

Bethe lattice (1,946 words) [view diff] exact match in snippet view article find links to article

eigenvalue of a d {\displaystyle d} -regular graph. Let G {\displaystyle G} be a d {\displaystyle d} -regular graph with n {\displaystyle n} vertices, and

Hypohamiltonian graph (2,469 words) [view diff] exact match in snippet view article find links to article

graph has at least one vertex with only three incident edges. If a 3-regular graph is Hamiltonian, its edges can be colored with three colors: use alternating

Klein quartic (3,263 words) [view diff] exact match in snippet view article find links to article

is a quotient of the heptagonal tiling (compare the 3-regular graph in green) and its dual triangular tiling (compare the 7-regular graph in violet).

Complex network (2,493 words) [view diff] exact match in snippet view article find links to article

that with the addition of only a small number of long-range links, a regular graph, in which the diameter is proportional to the size of the network, can

PPA (complexity) (548 words) [view diff] exact match in snippet view article

PPA. The problem of searching for a second Hamiltonian cycle on a 3-regular graph is a member of PPA, but is not known to be complete for PPA. There is

Zemor's decoding algorithm (3,235 words) [view diff] exact match in snippet view article find links to article

up, respectively, the vertex set and edge set of d {\displaystyle d} regular graph G {\displaystyle G} . Let us call the code C {\displaystyle C} constructed

Object co-segmentation (926 words) [view diff] exact match in snippet view article find links to article

especially in earlier image segmentation applications. As an extension of regular graph cuts, multi-level hypergraph cut is proposed to account for more complex

Thickness (graph theory) (1,265 words) [view diff] exact match in snippet view article

\lceil d/2\rceil } . This cannot be improved: for a d {\displaystyle d} -regular graph with girth at least 2 d {\displaystyle 2d} , the high girth forces any

Vizing's theorem (2,519 words) [view diff] exact match in snippet view article find links to article

one (Tait 1880). In 1969, Branko Grünbaum conjectured that every 3-regular graph with a polyhedral embedding on any two-dimensional oriented manifold

Graph minor (4,046 words) [view diff] exact match in snippet view article find links to article

theorem conjectured by W. T. Tutte and stating that any bridgeless 3-regular graph that requires four colors in an edge coloring must have the Petersen

Dominique de Caen (972 words) [view diff] case mismatch in snippet view article find links to article

Caen (1998). "The Spectra of Complementary Subgraphs in a Strongly Regular Graph". European Journal of Combinatorics. 19 (5): 559–565. doi:10.1006/eujc

Petersen's theorem (1,455 words) [view diff] exact match in snippet view article find links to article

log n (log log n)3), were given by Diks & Stanczyk (2010). If G is a regular graph of degree d whose edge connectivity is at least d − 1, and G has an

Degeneracy (graph theory) (3,393 words) [view diff] exact match in snippet view article

and Barabási–Albert networks are automatically m-degenerate. Every k-regular graph has degeneracy exactly k. More strongly, the degeneracy of a graph equals

Hyperbolic metric space (3,149 words) [view diff] exact match in snippet view article find links to article

of random groups (which is in effect a randomly-generated infinite regular graph) tend to be hyperbolic very often. It can be difficult and interesting

Interval edge coloring (1,659 words) [view diff] exact match in snippet view article find links to article

vertices and without separating triangles are interval colorable. If G is regular graph w(G)=∆(G) and G has an interval t-coloring for every t, w(G) ≤ t ≤ W(G)

Ruzsa–Szemerédi problem (2,129 words) [view diff] exact match in snippet view article find links to article

Several views of the Brouwer–Haemers graph, a non-tripartite 20-regular graph with 81 vertices in which each edge belongs to exactly one triangle

Circuit topology (electrical) (6,594 words) [view diff] exact match in snippet view article

required. Hypergraphs can be characterised by their incidence matrices. A regular graph containing only two-terminal components will have exactly two non-zero

Logic of graphs (5,029 words) [view diff] exact match in snippet view article find links to article

in MSO2 by the existence of a set of edges that forms a connected 2-regular graph on all the vertices, with connectivity expressed as above and 2-regularity

Apollonian network (4,741 words) [view diff] exact match in snippet view article find links to article

a similar exponential lower bound holds more generally for every 3-regular graph without cut edges, a result that was later proven. Andrade et al. (2005)

Quantum walk search (2,897 words) [view diff] exact match in snippet view article find links to article

of graph such as toroids and lattices, the shift is known, for non-regular graph the design of an effective shift operator is still an open challenge