Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q727035> ?p ?o }
Showing triples 1 to 59 of
59
with 100 triples per page.
- Q727035 subject Q7485314.
- Q727035 subject Q8234736.
- Q727035 subject Q8498905.
- Q727035 abstract "In graph theory, computer science and application areas such as sociology, an adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether pairs of vertices are adjacent or not in the graph.In the special case of a finite simple graph, the adjacency matrix is a (0,1)-matrix with zeros on its diagonal. If the graph is undirected, the adjacency matrix is symmetric. The relationship between a graph and the eigenvalues and eigenvectors of its adjacency matrix is studied in spectral graph theory.The adjacency matrix should be distinguished from the incidence matrix for a graph, a different matrix representation whose elements indicate whether vertex–edge pairs are incident or not.".
- Q727035 wikiPageExternalLink 12_1_AdjacencyMatrix_Repres.html.
- Q727035 wikiPageExternalLink article.php?page=GoodWillHunting.php.
- Q727035 wikiPageExternalLink fluffschack.jnlp.
- Q727035 wikiPageWikiLink Q1049914.
- Q727035 wikiPageWikiLink Q1137726.
- Q727035 wikiPageWikiLink Q1163608.
- Q727035 wikiPageWikiLink Q12916.
- Q727035 wikiPageWikiLink Q131476.
- Q727035 wikiPageWikiLink Q141488.
- Q727035 wikiPageWikiLink Q1564541.
- Q727035 wikiPageWikiLink Q166507.
- Q727035 wikiPageWikiLink Q174733.
- Q727035 wikiPageWikiLink Q175263.
- Q727035 wikiPageWikiLink Q178546.
- Q727035 wikiPageWikiLink Q1868547.
- Q727035 wikiPageWikiLink Q190524.
- Q727035 wikiPageWikiLink Q1994977.
- Q727035 wikiPageWikiLink Q207643.
- Q727035 wikiPageWikiLink Q21198.
- Q727035 wikiPageWikiLink Q21201.
- Q727035 wikiPageWikiLink Q230655.
- Q727035 wikiPageWikiLink Q2479726.
- Q727035 wikiPageWikiLink Q254491.
- Q727035 wikiPageWikiLink Q2642629.
- Q727035 wikiPageWikiLink Q264398.
- Q727035 wikiPageWikiLink Q2739329.
- Q727035 wikiPageWikiLink Q303100.
- Q727035 wikiPageWikiLink Q3033506.
- Q727035 wikiPageWikiLink Q3085841.
- Q727035 wikiPageWikiLink Q3115524.
- Q727035 wikiPageWikiLink Q3180727.
- Q727035 wikiPageWikiLink Q321102.
- Q727035 wikiPageWikiLink Q338028.
- Q727035 wikiPageWikiLink Q339011.
- Q727035 wikiPageWikiLink Q45715.
- Q727035 wikiPageWikiLink Q4724003.
- Q727035 wikiPageWikiLink Q512604.
- Q727035 wikiPageWikiLink Q5597093.
- Q727035 wikiPageWikiLink Q6086323.
- Q727035 wikiPageWikiLink Q692823.
- Q727035 wikiPageWikiLink Q726780.
- Q727035 wikiPageWikiLink Q7446630.
- Q727035 wikiPageWikiLink Q7485314.
- Q727035 wikiPageWikiLink Q7858715.
- Q727035 wikiPageWikiLink Q8234736.
- Q727035 wikiPageWikiLink Q849512.
- Q727035 wikiPageWikiLink Q849705.
- Q727035 wikiPageWikiLink Q8498905.
- Q727035 wikiPageWikiLink Q851512.
- Q727035 wikiPageWikiLink Q859174.
- Q727035 wikiPageWikiLink Q86920.
- Q727035 wikiPageWikiLink Q901698.
- Q727035 wikiPageWikiLink Q939272.
- Q727035 comment "In graph theory, computer science and application areas such as sociology, an adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether pairs of vertices are adjacent or not in the graph.In the special case of a finite simple graph, the adjacency matrix is a (0,1)-matrix with zeros on its diagonal. If the graph is undirected, the adjacency matrix is symmetric.".
- Q727035 label "Adjacency matrix".