Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Aperiodic_graph> ?p ?o. }
Showing items 1 to 27 of
27
with 100 items per page.
- Aperiodic_graph abstract "In the mathematical area of graph theory, a directed graph is said to be aperiodic if there is no integer k > 1 that divides the length of every cycle of the graph. Equivalently, a graph is aperiodic if the greatest common divisor of the lengths of its cycles is one; this greatest common divisor for a graph G is called the period of G.".
- Aperiodic_graph thumbnail Aperiodic-graph.svg?width=300.
- Aperiodic_graph wikiPageExternalLink markov.pdf.
- Aperiodic_graph wikiPageID "7220840".
- Aperiodic_graph wikiPageRevisionID "544554949".
- Aperiodic_graph hasPhotoCollection Aperiodic_graph.
- Aperiodic_graph subject Category:Graph_algorithms.
- Aperiodic_graph subject Category:Graph_families.
- Aperiodic_graph type Abstraction100002137.
- Aperiodic_graph type Family108078020.
- Aperiodic_graph type GraphFamilies.
- Aperiodic_graph type Group100031264.
- Aperiodic_graph type Organization108008335.
- Aperiodic_graph type SocialGroup107950920.
- Aperiodic_graph type Unit108189659.
- Aperiodic_graph type YagoLegalActor.
- Aperiodic_graph type YagoLegalActorGeo.
- Aperiodic_graph type YagoPermanentlyLocatedEntity.
- Aperiodic_graph comment "In the mathematical area of graph theory, a directed graph is said to be aperiodic if there is no integer k > 1 that divides the length of every cycle of the graph. Equivalently, a graph is aperiodic if the greatest common divisor of the lengths of its cycles is one; this greatest common divisor for a graph G is called the period of G.".
- Aperiodic_graph label "Aperiodic graph".
- Aperiodic_graph sameAs m.025wkns.
- Aperiodic_graph sameAs Q4779368.
- Aperiodic_graph sameAs Q4779368.
- Aperiodic_graph sameAs Aperiodic_graph.
- Aperiodic_graph wasDerivedFrom Aperiodic_graph?oldid=544554949.
- Aperiodic_graph depiction Aperiodic-graph.svg.
- Aperiodic_graph isPrimaryTopicOf Aperiodic_graph.