About: Graph (topology)     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FGraph_%28topology%29&invfp=IFP_OFF&sas=SAME_AS_OFF

In topology, a branch of mathematics, a graph is a topological space which arises from a usual graph by replacing vertices by points and each edge by a copy of the unit interval , where is identified with the point associated to and with the point associated to . That is, as topological spaces, graphs are exactly the simplicial 1-complexes and also exactly the one-dimensional CW complexes. Thus, in particular, it bears the quotient topology of the set The topology on this space is called the graph topology.

AttributesValues
rdfs:label
  • Graph (topology) (en)
rdfs:comment
  • In topology, a branch of mathematics, a graph is a topological space which arises from a usual graph by replacing vertices by points and each edge by a copy of the unit interval , where is identified with the point associated to and with the point associated to . That is, as topological spaces, graphs are exactly the simplicial 1-complexes and also exactly the one-dimensional CW complexes. Thus, in particular, it bears the quotient topology of the set The topology on this space is called the graph topology. (en)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • In topology, a branch of mathematics, a graph is a topological space which arises from a usual graph by replacing vertices by points and each edge by a copy of the unit interval , where is identified with the point associated to and with the point associated to . That is, as topological spaces, graphs are exactly the simplicial 1-complexes and also exactly the one-dimensional CW complexes. Thus, in particular, it bears the quotient topology of the set under the quotient map used for gluing. Here is the 0-skeleton (consisting of one point for each vertex ), are the intervals ("closed one-dimensional unit balls") glued to it, one for each edge , and is the disjoint union. The topology on this space is called the graph topology. (en)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is rdfs:seeAlso of
is Link from a Wikipage to another Wikipage of
is Wikipage disambiguates of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 51 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software