Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q3491411> ?p ?o }
Showing triples 1 to 26 of
26
with 100 triples per page.
- Q3491411 subject Q7007196.
- Q3491411 subject Q8498915.
- Q3491411 abstract "In the mathematical and algorithmic study of graph theory, the converse, transpose or reverse of a directed graph G is another directed graph on the same set of vertices with all of the edges reversed compared to the orientation of the corresponding edges in G. That is, if G contains an edge (u,v) then the converse/transpose/reverse of G contains an edge (v,u) and vice versa.".
- Q3491411 wikiPageWikiLink Q1137726.
- Q3491411 wikiPageWikiLink Q1195339.
- Q3491411 wikiPageWikiLink Q1248241.
- Q3491411 wikiPageWikiLink Q130901.
- Q3491411 wikiPageWikiLink Q131476.
- Q3491411 wikiPageWikiLink Q1375963.
- Q3491411 wikiPageWikiLink Q1501387.
- Q3491411 wikiPageWikiLink Q1514868.
- Q3491411 wikiPageWikiLink Q2003238.
- Q3491411 wikiPageWikiLink Q21198.
- Q3491411 wikiPageWikiLink Q223683.
- Q3491411 wikiPageWikiLink Q2655281.
- Q3491411 wikiPageWikiLink Q303100.
- Q3491411 wikiPageWikiLink Q474715.
- Q3491411 wikiPageWikiLink Q554403.
- Q3491411 wikiPageWikiLink Q7007196.
- Q3491411 wikiPageWikiLink Q727035.
- Q3491411 wikiPageWikiLink Q7534781.
- Q3491411 wikiPageWikiLink Q7978783.
- Q3491411 wikiPageWikiLink Q816319.
- Q3491411 wikiPageWikiLink Q8498915.
- Q3491411 comment "In the mathematical and algorithmic study of graph theory, the converse, transpose or reverse of a directed graph G is another directed graph on the same set of vertices with all of the edges reversed compared to the orientation of the corresponding edges in G. That is, if G contains an edge (u,v) then the converse/transpose/reverse of G contains an edge (v,u) and vice versa.".
- Q3491411 label "Transpose graph".