Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Graph_canonization> ?p ?o. }
Showing items 1 to 13 of
13
with 100 items per page.
- Graph_canonization abstract "In graph theory, a branch of mathematics, graph canonization is finding a canonical form of a graph G, which is a graph Canon(G) isomorphic to G such that Canon(H) = Canon(G) if and only if H is isomorphic to G. The canonical form of a graph is an example of a complete graph invariant. Since the vertex sets of (finite) graphs are commonly identified with the intervals of integers 1,..., n, where n is the number of the vertices of a graph, a canonical form of a graph is commonly called canonical labeling of a graph. Graph canonization is also sometimes known as graph canonicalization.A commonly known canonical form is the lexicographically smallest graph within the isomorphism class, which is the graph of the class with lexicographically smallest adjacency matrix considered as a linear string.".
- Graph_canonization wikiPageExternalLink 131.pdf.
- Graph_canonization wikiPageID "20199287".
- Graph_canonization wikiPageRevisionID "600784784".
- Graph_canonization hasPhotoCollection Graph_canonization.
- Graph_canonization subject Category:Graph_theory.
- Graph_canonization comment "In graph theory, a branch of mathematics, graph canonization is finding a canonical form of a graph G, which is a graph Canon(G) isomorphic to G such that Canon(H) = Canon(G) if and only if H is isomorphic to G. The canonical form of a graph is an example of a complete graph invariant.".
- Graph_canonization label "Graph canonization".
- Graph_canonization sameAs m.04ydpqz.
- Graph_canonization sameAs Q5597079.
- Graph_canonization sameAs Q5597079.
- Graph_canonization wasDerivedFrom Graph_canonization?oldid=600784784.
- Graph_canonization isPrimaryTopicOf Graph_canonization.