This HTML5 document contains 102 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
n11http://dbpedia.org/resource/File:
foafhttp://xmlns.com/foaf/0.1/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n5http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n15http://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Directed_graph
rdf:type
owl:Thing
rdfs:label
Directed graph
rdfs:comment
In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed edges often called arcs.
rdfs:seeAlso
dbr:Graph_(discrete_mathematics)
owl:sameAs
yago-res:Directed_graph freebase:m.04m_mb4
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Nobreak dbt:ISBN dbt:Cmn dbt:Expand_list dbt:See_also dbt:Commons_category dbt:Citation dbt:Main dbt:Short_description
dct:subject
dbc:Graph_theory dbc:Directed_graphs
dbo:thumbnail
n5:Directed.svg?width=300
foaf:depiction
n5:Directed_acyclic_graph_2.svg n5:4-tournament.svg n5:Incidence_matrix_-_directed_graph.svg n5:Directed.svg n5:DirectedDegrees.svg
prov:wasDerivedFrom
n15:Directed_graph?oldid=1052117995&ns=0
dbo:wikiPageID
19721986
dbo:wikiPageLength
15607
dbo:wikiPageRevisionID
1052117995
dbo:wikiPageWikiLink
dbr:Flow_graph_(mathematics) dbr:Loop_(graph_theory) dbr:Tournament_(graph_theory) dbr:Set_(mathematics) dbr:Graph_(abstract_data_type) dbr:Kleitman–Wang_algorithms dbr:Graph_(discrete_mathematics) dbr:Free_category dbr:Glossary_of_graph_theory dbr:Tree_(graph_theory) dbr:Binary_relation dbr:Matrix_(mathematics) dbr:Coates_graph dbr:Finite-state_machine dbc:Graph_theory dbr:Complete_graph dbr:Control-flow_graph dbr:Natural_transformation dbc:Directed_graphs dbr:Signal-flow_graph dbr:Topological_sorting dbr:Directed_acyclic_graph dbr:Weighted_network dbr:Flow_network dbr:Transpose_graph dbr:On-Line_Encyclopedia_of_Integer_Sequences dbr:Commutative_diagram dbr:Element_(mathematics) dbr:Integer dbr:Globular_set dbr:Branching_factor dbr:Rooted_graph dbr:Multitree dbr:Digraph_realization_problem dbr:Strongly_connected_component dbr:Graph_Style_Sheets dbr:Functor_category dbr:Network_theory dbr:Adjacency_matrix dbr:Quiver_(mathematics) dbr:Multiset n11:Directed.svg dbr:Unordered_pair dbr:Vector_space dbr:Category_theory dbr:Vertex_(graph_theory) dbr:Flowchart dbr:Functor dbr:Incidence_matrix dbr:DRAKON dbr:Multigraph dbr:Polytree n11:Incidence_matrix_-_directed_graph.svg dbr:Graph_theory dbr:Field_(mathematics) dbr:Springer_Science+Business_Media dbr:State_diagram dbr:Constraint_graph_(layout) dbr:Mathematics n11:4-tournament.svg dbr:Springer_Nature dbr:Connectivity_(graph_theory) dbr:Preorder dbr:Orientation_(graph_theory) dbr:Lie_group dbr:Linear_map dbr:Cycle_(graph_theory) dbr:Ordered_pair dbr:Fulkerson–Chen–Anstee_theorem n11:DirectedDegrees.svg dbr:Path_(graph_theory) n11:Directed_acyclic_graph_2.svg
dbo:abstract
In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed edges often called arcs.
foaf:isPrimaryTopicOf
n15:Directed_graph