Search Results for ""
1061 - 1070 of 2499 for Strongly regular graphSearch Results
A hexagonal antiprism is an antiprism having hexagons as its bases. A stretched hexagonal antiprism is the convex hull of the tetrahedron 3-compound. The dual polyhedron of ...
A dipyramid having a hexagonal base. The volume of a hexagonal pyramid having a regular hexagon with side length a as a base and of half-height h is therefore V=sqrt(3)a^2h. ...
Polypons are polyforms obtained from dividing a regular triangular grid into 30-30-120 triangles, illustrated above. The numbers of polypons with n=1, 2, ... components are ...
Let f_n(z) be a sequence of functions, each regular in a region D, let |f_n(z)|<=M for every n and z in D, and let f_n(z) tend to a limit as n->infty at a set of points ...
The total domination number gamma_t of a graph is the size of a smallest total dominating set, where a total dominating set is a set of vertices of the graph such that all ...
An edge of a graph is said to be pendant if one of its vertices is a pendant vertex.
A vertex of a graph is said to be pendant if its neighborhood contains exactly one vertex.
A pair of vertices (x,y) of a graph G is called an omega-critical pair if omega(G+xy)>omega(G), where G+xy denotes the graph obtained by adding the edge xy to G and omega(H) ...
A local source is a node of a directed graph with no entering edges (Borowski and Borwein 1991, p. 401; left figure), and a global source (often simply called a source) is a ...
A block is a maximal connected subgraph of a given graph G that has no articulation vertex (West 2000, p. 155). If a block has more than two vertices, then it is biconnected. ...
...
View search results from all Wolfram sites (17277 matches)

