| http://dbpedia.org/ontology/abstract
|
In graph theory, a bound graph expresses w … In graph theory, a bound graph expresses which pairs of elements of some partially ordered set have an upper bound. Rigorously, any graph G is a bound graph if there exists a partial order ≤ on the vertices of G with the property that for any vertices u and v of G, uv is an edge of G if and only if u ≠ v and there is a vertex w such that u ≤ w and v ≤ w. Bound graphs are sometimes referred to as upper bound graphs, but the analogously defined lower bound graphs comprise exactly the same class—any lower bound for ≤ is easily seen to be an upper bound for the dual partial order ≥. upper bound for the dual partial order ≥.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
http://www.combinatorics.org/Volume_7/PDF/v7i1r43.pdf%7C +
|
| http://dbpedia.org/ontology/wikiPageID
|
13193620
|
| http://dbpedia.org/ontology/wikiPageLength
|
1807
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1021974702
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Duality_%28order_theory%29 +
, http://dbpedia.org/resource/Edge_%28graph_theory%29 +
, http://dbpedia.org/resource/Vertex_%28graph_theory%29 +
, http://dbpedia.org/resource/Category:Graph_families +
, http://dbpedia.org/resource/Graph_theory +
, http://dbpedia.org/resource/Upper_bound +
, http://dbpedia.org/resource/Partially_ordered_set +
, http://dbpedia.org/resource/Category:Order_theory +
, http://dbpedia.org/resource/Graph_%28discrete_mathematics%29 +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Orphan +
, http://dbpedia.org/resource/Template:Cite_journal +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Order_theory +
, http://dbpedia.org/resource/Category:Graph_families +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Bound_graph?oldid=1021974702&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Bound_graph +
|
| owl:sameAs |
http://www.wikidata.org/entity/Q4949882 +
, https://global.dbpedia.org/id/4abjY +
, http://yago-knowledge.org/resource/Bound_graph +
, http://dbpedia.org/resource/Bound_graph +
, http://rdf.freebase.com/ns/m.03byf7p +
|
| rdf:type |
http://dbpedia.org/class/yago/Abstraction100002137 +
, http://dbpedia.org/class/yago/Organization108008335 +
, http://dbpedia.org/class/yago/WikicatGraphFamilies +
, http://dbpedia.org/class/yago/Group100031264 +
, http://dbpedia.org/class/yago/Unit108189659 +
, http://dbpedia.org/class/yago/SocialGroup107950920 +
, http://dbpedia.org/class/yago/Family108078020 +
, http://dbpedia.org/class/yago/YagoLegalActorGeo +
, http://dbpedia.org/class/yago/YagoLegalActor +
, http://dbpedia.org/class/yago/YagoPermanentlyLocatedEntity +
|
| rdfs:comment |
In graph theory, a bound graph expresses w … In graph theory, a bound graph expresses which pairs of elements of some partially ordered set have an upper bound. Rigorously, any graph G is a bound graph if there exists a partial order ≤ on the vertices of G with the property that for any vertices u and v of G, uv is an edge of G if and only if u ≠ v and there is a vertex w such that u ≤ w and v ≤ w. Bound graphs are sometimes referred to as upper bound graphs, but the analogously defined lower bound graphs comprise exactly the same class—any lower bound for ≤ is easily seen to be an upper bound for the dual partial order ≥. upper bound for the dual partial order ≥.
|
| rdfs:label |
Bound graph
|
