Lazo
English translation: Loop
| GLOSSARY ENTRY (DERIVED FROM QUESTION BELOW) | ||||
|---|---|---|---|---|
|
| 08:26 May 14, 2017 |
|
| Spanish to English translations [PRO] Science - Mathematics & Statistics / Graph theory | |||||||
|---|---|---|---|---|---|---|---|
|
| ||||||
|  Selected response from: Helena Chavarria Spain Local time: 04:57 | ||||||
Grading comment
| |||||||
| Summary of answers provided | ||||
|---|---|---|---|---|
| 4 +1 | Loop |
|
| Summary of reference entries provided | |||
|---|---|---|---|
|
| Discussion entries: 4 | |
|---|---|
Answers
50 mins confidence: 
peer agreement (net): +1
peer agreement (net): +1Loop Explanation: Loop An arc whose beginning and end both link into the same vertex. http://www.ucl.ac.uk/~ucahbtw/docs/d1lesson1/D1_graphs_gloss... -------------------------------------------------- Note added at 55 mins (2017-05-14 09:22:24 GMT) -------------------------------------------------- In graph theory, a loop (also called a self-loop or a "buckle") is an edge that connects a vertex to itself. A simple graph contains no loops. https://en.wikipedia.org/wiki/Loop_(graph_theory) A loop is an edge whose endpoints are equal i.e., an edge joining a vertex to it self is called a loop. http://www.personal.kent.edu/~rmuhamma/GraphTheory/MyGraphTh... -------------------------------------------------- Note added at 56 mins (2017-05-14 09:23:47 GMT) -------------------------------------------------- A degenerate edge of a graph which joins a vertex to itself, also called a self-loop. A simple graph cannot contain any loops, but a pseudograph can contain both multiple edges and loops. http://mathworld.wolfram.com/GraphLoop.html -------------------------------------------------- Note added at 1 hr (2017-05-14 09:27:10 GMT) -------------------------------------------------- En teoría de grafos, un bucle o loop es una arista que conecta un vértice consigo mismo. Un grafo simple no posee bucles. https://es.wikipedia.org/wiki/Bucle_(teoría_de_grafos) |
| |
Grading comment
| ||
| Login to enter a peer comment (or grade) | ||
Reference comments
43 mins |
| Reference Reference information: Cycle A cycle is a closed path (i.e. the end of the last edge is the start of the first, and no vertices are repeated except that the final vertex is the same as the first). http://www.ucl.ac.uk/~ucahbtw/docs/d1lesson1/D1_graphs_gloss... |
| |
| Login to enter a peer comment (or grade) | ||
Login or register (free and only takes a few minutes) to participate in this question.
You will also have access to many other tools and opportunities designed for those who have language-related jobs (or are passionate about them). Participation is free and the site has a strict confidentiality policy.
KudoZ™ translation help
The KudoZ network provides a framework for translators and others to assist each other with translations or explanations of terms and short phrases.
See also:
Search millions of term translations