전문 번역가, 번역 회사, 웹 페이지 및 자유롭게 사용할 수 있는 번역 저장소 등을 활용합니다.
el grafo de rado es un grafo infinito autocomplementario.
the rado graph is an infinite self-complementary graph.
마지막 업데이트: 2016-03-03
사용 빈도: 1
품질:
un grafo autocomplementario es un grafo que es isomorfo a su complemento.
a self-complementary graph is a graph which is isomorphic to its complement.
마지막 업데이트: 2016-03-03
사용 빈도: 1
품질:
se llama grafo autocomplementario a aquél que es isomorfo a su propio complemento.
*a self-complementary graph is a graph that is isomorphic to its own complement.
마지막 업데이트: 2016-03-03
사용 빈도: 1
품질:
dicha no separabilidad se observa fundamentalmente en el grupo pan y cereales, el cual es autocomplementario en los períodos inmediatamente anterior y posterior al corriente.
this nonsepparability over time is observed on bread and cereals, which is on autocomplement in the periods immediately before and after the current one.
마지막 업데이트: 2018-02-13
사용 빈도: 1
품질:
todo grafo fuertemente regular y autocomplementario con menos de 37 vértices es un grafo de paley; pero, hay grafos fuertemente regulares con 37, 41 y 49 vértices que no son grafos de paley.
all strongly regular self-complementary graphs with fewer than 37 vertices are paley graphs; however, there are strongly regular graphs on 37, 41, and 49 vertices that are not paley graphs.
마지막 업데이트: 2016-03-03
사용 빈도: 1
품질:
== propiedades ==un grafo autocomplementario de "n" vértices tiene exactamente la mitad de aristas que su grafo completo, en este caso, "n"("n" − 1)/4 aristas, y (si tiene más de un vértice) debe tener diámetro 2 o 3.
==properties==an "n"-vertex self-complementary graph has exactly half number of edges of the complete graph, i.e., "n"("n" − 1)/4 edges, and (if there is more than one vertex) it must have diameter either 2 or 3.
마지막 업데이트: 2016-03-03
사용 빈도: 1
품질:
경고: 보이지 않는 HTML 형식이 포함되어 있습니다