About: BF-graph

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In graph theory, a BF-graph is a type of directed hypergraph where each hyperedge is directed either to one particular vertex or away from one particular vertex. In a directed hypergraph, each hyperedge may be directed away from some of its vertices (its tails) and towards some others of its vertices (its heads).A hyperedge that is directed to a single head vertex, and away from all its other vertices, is called a B-arch. Symmetrically, a hyperedge that is directed away from a single tail vertex, and towards all its other vertices, is called an F-arc.

Property Value
dbo:abstract
  • In graph theory, a BF-graph is a type of directed hypergraph where each hyperedge is directed either to one particular vertex or away from one particular vertex. In a directed hypergraph, each hyperedge may be directed away from some of its vertices (its tails) and towards some others of its vertices (its heads).A hyperedge that is directed to a single head vertex, and away from all its other vertices, is called a B-arch. Symmetrically, a hyperedge that is directed away from a single tail vertex, and towards all its other vertices, is called an F-arc. A hypergraph with only B-arcs is a B-graph and a hypergraph with only F-arcs is a F-graph. (en)
  • En théorie des graphes, un BF-graphe est un hypergraphe orienté où tous les hyperarcs sont soit des B-arcs, soit des F-arcs. Un B-arc est un hyperarc orienté dont la tête est de taille , tandis qu'un F-arc est un hyperarc orienté dont la queue est de taille . (fr)
dbo:wikiPageID
  • 31803163 (xsd:integer)
dbo:wikiPageLength
  • 1346 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1091054342 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdfs:comment
  • En théorie des graphes, un BF-graphe est un hypergraphe orienté où tous les hyperarcs sont soit des B-arcs, soit des F-arcs. Un B-arc est un hyperarc orienté dont la tête est de taille , tandis qu'un F-arc est un hyperarc orienté dont la queue est de taille . (fr)
  • In graph theory, a BF-graph is a type of directed hypergraph where each hyperedge is directed either to one particular vertex or away from one particular vertex. In a directed hypergraph, each hyperedge may be directed away from some of its vertices (its tails) and towards some others of its vertices (its heads).A hyperedge that is directed to a single head vertex, and away from all its other vertices, is called a B-arch. Symmetrically, a hyperedge that is directed away from a single tail vertex, and towards all its other vertices, is called an F-arc. (en)
rdfs:label
  • BF-graph (en)
  • BF-graphe (fr)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License