TOPICS
Search

Search Results for ""


2721 - 2730 of 13135 for Discrete groupSearch Results
"Conext 21 polyhedron" is the name given here to the solid underlying the soccer ball of the 2020 Tokyo Olympic Games (held in 2021). It is implemented in the Wolfram ...
A reduction system is called confluent (or globally confluent) if, for all x, u, and w such that x->_*u and x->_*w, there exists a z such that u->_*z and w->_*z. A reduction ...
The connected domination number of a connected graph G, denoted d(G), is the size of a minimum connected dominating set of a graph G. The maximum leaf number l(G) and ...
A tag system in which a list of n tag rules (each of a special form) is applied to a system in sequential order and then starting again from the first rule. In a cyclic tag ...
If the three straight lines joining the corresponding vertices of two triangles ABC and A^'B^'C^' all meet in a point (the perspector), then the three intersections of pairs ...
The detour matrix Delta, sometimes also called the maximum path matrix or maximal topological distances matrix, of a graph is a symmetric matrix whose (i,j)th entry is the ...
The detour polynomial of a graph G is the characteristic polynomial of the detour matrix of G. Precomputed detour polynomials for many named graphs are available in the ...
A convex polyomino containing at least one edge of its minimal bounding rectangle. The perimeter and area generating function for directed polygons of width m, height n, and ...
A graph in which each graph edge is replaced by a directed graph edge, also called a digraph. A directed graph having no multiple edges or loops (corresponding to a binary ...
The distance polynomial is the characteristic polynomial of the graph distance matrix. The following table summarizes distance polynomials for some common classes of graphs. ...
1 ... 270|271|272|273|274|275|276 ... 1314 Previous Next

...