TOPICS
Search

Search Results for ""


971 - 980 of 2499 for Strongly regular graphSearch Results
The endodocehedron, also called the concave pyrohedral dodecahedron, is the concave solid corresponding to the interior void formed when each face of a regular dodecahedron ...
The pentagonal wegde is one of the seven topologically distinct convex hexahedra. Like the cube, it contains 8 vertices, 12 edges, and 6 faces, but its faces consist of 2 ...
The Fano plane is the configuration consisting of the two-dimensional finite projective plane over GF(2) ("of order two"), illustrated above. It is a block design with nu=7, ...
Let S be a collection of subsets of a finite set X. A subset Y of X that meets every member of S is called the vertex cover, or hitting set. A vertex cover of a graph G can ...
Wagner's theorem states that a graph is planar iff it does not contain K_5 or K_(3,3) as a graph minor.
Let G be a graph, and suppose each edge of G is independently deleted with fixed probability 0<=p<=1. Then the probability that no connected component of G is disconnected as ...
Let G be a finite, connected, undirected graph with graph diameter d(G) and graph distance d(u,v) between vertices u and v. A radio labeling of a graph G is labeling using ...
The Sombor index of a graph is defined as half the sum of the matrix elements of its Sombor matrix.
Let d_G(k) be the number of dominating sets of size k in a graph G, then the domination polynomial D_G(x) of G in the variable x is defined as ...
Given a circle, the apothem is the perpendicular distance r from the midpoint of a chord to the circle's center. It is also equal to the radius R minus the sagitta h, r=R-h. ...
1 ... 95|96|97|98|99|100|101 ... 250 Previous Next

...