BF-graph
id:
bf-graph-302-14675578
title:
BF-graph
text:
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 and towards some others of its vertices.
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 o
brand slug:
wiki
category slug:
encyclopedia
description:
Type of directed hypergraph
original url:
https://en.wikipedia.org/wiki/BF-graph
date created:
date modified:
2024-02-16T11:27:14Z
main entity:
{"identifier":"Q2877010","url":"https://www.wikidata.org/entity/Q2877010"}
image:
fields total:
13
integrity:
14