Search Results for ""

"Vertex" is a synonym for a node of a graph, i.e., one of the points on which the graph is defined and which may be connected by graph edges. The terms "point," "junction," ...

A Hamiltonian walk on a connected graph is a closed walk of minimal length which visits every vertex of a graph (and may visit vertices and edges multiple times). For ...

The first example discovered of a map from a higher-dimensional sphere to a lower-dimensional sphere which is not null-homotopic. Its discovery was a shock to the ...

An imperfect graph G is a graph that is not perfect. Therefore, graphs G with omega(G)<chi(G) (1) where omega(G) is the clique number and chi(G) is the chromatic number are ...

If the square is instead erected internally, their centers form a triangle DeltaI_AI_BI_C that has (exact) trilinear vertex matrix given by (1) (E. Weisstein, Apr. 25, 2004). ...

An integral graph, not to be confused with an integral embedding of a graph, is defined as a graph whose graph spectrum consists entirely of integers. The notion was first ...

Solving the nome q for the parameter m gives m(q) = (theta_2^4(q))/(theta_3^4(q)) (1) = (16eta^8(1/2tau)eta^(16)(2tau))/(eta^(24)(tau)), (2) where theta_i(q)=theta_i(0,q) is ...

An isolated point of a graph is a node of degree 0 (Hartsfield and Ringel 1990, p. 8; Harary 1994, p. 15; D'Angelo and West 2000, p. 212; West 2000, p. 22). The number of ...

"Jabulani polyhedron" is a term introduced here to refer to the polyhedron illustrated above which underlies the shape of the soccer ball used in the 2010 World Cup in South ...

The Jahangir graph J_(n,m) is a kind of generalized wheel graph with consisting of mn circular vertices and a central vertex connected to every mth vertex around the circle. ...