enow.com Web Search

Search results

1. Results from the WOW.Com Content Network

2. Crossing number (graph theory) - Wikipedia

   en.wikipedia.org/wiki/Crossing_number_(graph_theory)

   The smallest 6-crossing cubic graph is the Desargues graph, with 20 vertices. None of the four 7-crossing cubic graphs, with 22 vertices, are well known. [14] The smallest 8-crossing cubic graphs include the Nauru graph and the McGee graph or (3,7)-cage graph, with 24 vertices. [15]

3. Intersection number (graph theory) - Wikipedia

   en.wikipedia.org/wiki/Intersection_number_(graph...

   In the mathematical field of graph theory, the intersection number of a graph = (,) is the smallest number of elements in a representation of as an intersection graph of finite sets. In such a representation, each vertex is represented as a set, and two vertices are connected by an edge whenever their sets have a common element.

4. Intersection number - Wikipedia

   en.wikipedia.org/wiki/Intersection_number

   The second potential problem is that even if the intersection is zero-dimensional, it may be non-transverse, for example, if V is a plane curve and W is one of its tangent lines. The first problem requires the machinery of intersection theory, discussed above in detail, which replaces V and W by more convenient subvarieties using the moving lemma.

5. Shortest path problem - Wikipedia

   en.wikipedia.org/wiki/Shortest_path_problem

   One example is the constrained shortest path problem, [16] which attempts to minimize the total cost of the path while at the same time maintaining another metric below a given threshold. This makes the problem NP-complete (such problems are not believed to be efficiently solvable for large sets of data, see P = NP problem).

6. Unit disk graph - Wikipedia

   en.wikipedia.org/wiki/Unit_disk_graph

   A collection of unit circles and the corresponding unit disk graph. In geometric graph theory, a unit disk graph is the intersection graph of a family of unit disks in the Euclidean plane. That is, it is a graph with one vertex for each disk in the family, and with an edge between two vertices whenever the corresponding vertices lie within a ...

7. Intersection (geometry) - Wikipedia

   en.wikipedia.org/wiki/Intersection_(geometry)

   This proves that all points in the intersection are the same distance from the point E in the plane P, in other words all points in the intersection lie on a circle C with center E. [5] This proves that the intersection of P and S is contained in C. Note that OE is the axis of the circle. Now consider a point D of the circle C. Since C lies in ...