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

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

PrefixNamespace IRI
dbpedia-owlhttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n4http://commons.wikimedia.org/wiki/Special:FilePath/Isospectral_enneahedra.
n6http://commons.wikimedia.org/wiki/Special:FilePath/Isospectral_enneahedra.svg?width=
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
xsdhhttp://www.w3.org/2001/XMLSchema#
dbpediahttp://dbpedia.org/resource/
Subject Item
dbpedia:Spectral_graph_theory
rdfs:comment
In mathematics, spectral graph theory is the study of properties of a graph in relationship to the characteristic polynomial, eigenvalues, and eigenvectors of matrices associated to the graph, such as its adjacency matrix or Laplacian matrix.An undirected graph has a symmetric adjacency matrix and therefore has real eigenvalues (the multiset of which is called the graph's spectrum) and a complete set of orthonormal eigenvectors.While the adjacency matrix depends on the vertex labeling, its spectrum is a graph invariant.Spectral graph theory is also concerned with graph parameters that are defined via multiplicities of eigenvalues of matrices associated to the graph, such as the Colin de Verdière number.
foaf:depiction
n4:svg
dbpedia-owl:thumbnail
n6:300