Examples of using Complete graph in English and their translations into Spanish
{-}
-
Colloquial
-
Official
Be sure to create a complete graph.
Asegúrate de crear un gráfico completo.We have a complete graph with vertices.
Tenemos un gráfico completo con Vértices.Plot and connect the points on a complete graph.
Dibuja y conecta los puntos en un gráfico completo.A complete graph of order 3 is called a triangle.
What do you think the complete graph looks like?
¿Cómo crees que se ve el gráfico completo?A complete graph with more than two vertices is Hamiltonian.
Los grafos completos con más de dos vértices son hamiltonianos.The complement of an edgeless graph is a complete graph and vice versa.
Cada grafo de intervalo adecuado es un claw-free graph.A complete graph on n{\displaystyle n} vertices is denoted by the symbol K n{\displaystyle K_{n.
Un grafo completo de n vértices se denota por K n{\displaystyle K_{n}\.Note- A combination of two complementary graphs gives a complete graph.
Nota- Una combinación de dos Suppose the edges of a complete graph on 6 vertices are coloured red and blue.
Supongamos que las aristas de un grafo completo de 6 vértices están coloreadas en rojo y verde.In general, a complete bipartite graph is not a complete graph.
En general, un Often, the model is a complete graph i.e. each pair of vertices is connected by an edge.
Con frecuencia, el modelo es un grafo completo cada par de vértices es conectado por una arista.This is equivalent to the condition that the induced subgraph of G induced by C is a complete graph.
Esto equivale a decir que el subgrafo de G inducido por C es un grafo completo.For instance, a complete graph with four vertices a, b, c, and d has three perfect matchings: ab and cd, ac and bd, and ad and bc.
Por ejemplo, un grafo completo con cuatro vértices a, b, c, y d tienen tres apareamientos perfectos: ab y cd, ac y bd, y ad y bc.It is a generalization of Cayley's formula which provides the number of spanning trees in a complete graph.
Es una generalización de la fórmula de Cayley que provee el número total de árboles de expansión en un grafo completo.The graph Q0 consists of a single vertex,while Q1 is the complete graph on two vertices and Q2 is a cycle of length 4.
El In older mathematical terminology,the phrase"universal graph" was sometimes used to denote a complete graph.
En terminología matemática más antigua,la frase"grafo universal" fue a veces utilizada para denotar a los grafos completos.The(r, 3)-cage is a complete graph Kr+1 on r+1 vertices, and the(r, 4)-cage is a complete bipartite graph Kr, r on 2r vertices.
The seven vertices and 21 edges of the Császár polyhedron form an embedding of the complete graph K 7{\displaystyle K_{7}} onto a topological torus.
Los 7 vértices y 21 aristas del poliedro forma el grafo completo K 7{\displaystyle K_{7}} sobre la superficie de un toro.For example, consider a complete graph of order n; that is, there are n vertices and each vertex is connected to every other vertex by an edge.
Por ejemplo, consideremos un grafo completo de orden n, es decir, hay n vértices y cada vértice está conectado a todos los otros vértices por medio de una arista.The Turán graph T(2n, n) can be formed by removing a perfect matching from a complete graph K2n.
El In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge.
En teoría de Another problem in subdivisioncontainment is Kelmans-Seymour conjecture: Every 5-vertex-connected graph that is not planar contains a subdivision of the 5-vertex complete graph K5.
Otro problema en la subdivisión de contenido es la conjetura de Kelmans-Seymour:Cada That is, it is an orientation of a complete graph, or equivalently a directed graph in which every pair of distinct vertices is connected by a directed edge with any one of the two possible orientations.
Esto es, una orientación de un grafo completo, o equivalentemente un Some authors exclude graphs which satisfy the definition trivially,namely those graphs which are the disjoint union of one or more equal-sized complete graphs, and their complements, the Turán graphs. .
Algunos autores excluyen gráficos que satisfacen la definición trivialmente,a saber, aquellos gráficos que son la unión disjunta de uno o más grafos completos de igual tamaño, y sus complementos, los That is, if the conjectured formula for the crossing number of the complete graph is correct, then every n-chromatic graph has crossing number at least equal to the same formula.
Es decir, si la conjetura de Guy-Saaty sobre el número de cruce del grafo completo es válida, cada In such a graph, any single vertex v has n possible choices of vertex that it can be matched to, andonce this choice is made the remaining problem is one of selecting a perfect matching in a complete graph with two fewer vertices.
De tal This replaces the original graph with a complete graph in which the inter-city distance d A B{\displaystyle d_{AB}} is replaced by the shortest path between A and B in the original graph.
Este remplaza el More precisely, the theorem states that for any given number of colours, c, and any given integers n1,…, nc, there is a number, R(n1,…, nc),such that if the edges of a complete graph of order R(n1,…, nc) are coloured with c different colours, then for some i between 1 and c, it must contain a complete subgraph of order ni whose edges are all colour i.
Más precisamente, el teorema enuncia que por cualquier número dado de colores«c», y cualquier entero n1,…, nc, existe un número, R(n1,…, nc),que si las aristas de un grafo completo de orden R(n1,…,nc) se colorea con c colores diferentes, entonces para algún i entre 1 y c, debe contener un subgrafo This also is a special case of Ramsey's theorem, which says that for any given integer c, any given integers n1,…, nc, there is a number, R(n1,…,nc),such that if the edges of a complete graph of order R(n1,…,nc) are coloured with c different colours, then for some i between 1 and c, it must contain a complete subgraph of order ni whose edges are all colour i.
Este es un caso especial del teorema de Ramsey, que dice que para cualquier entero dado c, y dado los enteros n1,…, nc, existe el número: R(n1,…,nc), llamado número de Ramsey,tal que si las aristas de un grafo completo de orden R(n1,…,nc) se colorean con c colores distintos, entonces para algún i entre 1 y c, debe contener un subgrafo 
