Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Cycle_(graph_theory)> ?p ?o. }
Showing items 1 to 29 of
29
with 100 items per page.
- Cycle_(graph_theory) abstract "In graph theory, two types of object are commonly called cycles.One type of cycle, more commonly called a closed walk, consists of a sequence of vertices starting and ending at the same vertex, with each two consecutive vertices in the sequence adjacent to each other in the graph. The other type of cycle, sometimes called a simple cycle, circuit, circle, or polygon, is a closed walk with no repetitions of vertices and edges allowed, other than the repetition of the starting and ending vertex. Simple cycles may also be described by their sets of edges, unlike closed walks for which the multiset of edges does not unambiguously determine the vertex ordering.A directed cycle in a directed graph is a sequence of vertices starting and ending at the same vertex such that, for each two consecutive vertices of the cycle, there exists an edge directed from the earlier vertex to the later one; the same distinction between closed walks and simple cycles may be made in the directed case.".
- Cycle_(graph_theory) thumbnail Graph_cycle.gif?width=300.
- Cycle_(graph_theory) wikiPageID "168609".
- Cycle_(graph_theory) wikiPageRevisionID "606004604".
- Cycle_(graph_theory) hasPhotoCollection Cycle_(graph_theory).
- Cycle_(graph_theory) subject Category:Graph_theory_objects.
- Cycle_(graph_theory) type GraphTheoryObjects.
- Cycle_(graph_theory) type Object100002684.
- Cycle_(graph_theory) type PhysicalEntity100001930.
- Cycle_(graph_theory) comment "In graph theory, two types of object are commonly called cycles.One type of cycle, more commonly called a closed walk, consists of a sequence of vertices starting and ending at the same vertex, with each two consecutive vertices in the sequence adjacent to each other in the graph. The other type of cycle, sometimes called a simple cycle, circuit, circle, or polygon, is a closed walk with no repetitions of vertices and edges allowed, other than the repetition of the starting and ending vertex.".
- Cycle_(graph_theory) label "Ciclo (teoria de grafos)".
- Cycle_(graph_theory) label "Cycle (graph theory)".
- Cycle_(graph_theory) label "Cycle (théorie des graphes)".
- Cycle_(graph_theory) label "Cykl (teoria grafów)".
- Cycle_(graph_theory) label "Zyklus (Graphentheorie)".
- Cycle_(graph_theory) label "Цикл (теория графов)".
- Cycle_(graph_theory) label "環 (圖論)".
- Cycle_(graph_theory) label "閉路".
- Cycle_(graph_theory) sameAs Zyklus_(Graphentheorie).
- Cycle_(graph_theory) sameAs Cycle_(théorie_des_graphes).
- Cycle_(graph_theory) sameAs 閉路.
- Cycle_(graph_theory) sameAs Cykl_(teoria_grafów).
- Cycle_(graph_theory) sameAs Ciclo_(teoria_de_grafos).
- Cycle_(graph_theory) sameAs Q245595.
- Cycle_(graph_theory) sameAs Q245595.
- Cycle_(graph_theory) sameAs Cycle_(graph_theory).
- Cycle_(graph_theory) wasDerivedFrom Cycle_(graph_theory)?oldid=606004604.
- Cycle_(graph_theory) depiction Graph_cycle.gif.
- Cycle_(graph_theory) isPrimaryTopicOf Cycle_(graph_theory).
