Wikipedia

BF-graph

This is an old revision of this page, as edited by Grazan (talk | contribs) at 22:35, 18 May 2019 (Deletion of a repeated sentence). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

References

  • G. Gallo; G.Longo; S. Nguyen; S. Pallottino (1993). Directed hypergraphs and applications. Vol. 42. pp. 177–201. {{cite book}}: |journal= ignored (help); Unknown parameter |last-author-amp= ignored (|name-list-style= suggested) (help)
  • S. Nguyen; D. Pretolani; L. Markenson (1998). On Some Path Problems on Oriented Hypergraphs. Vol. 32. pp. 1–20. {{cite book}}: |journal= ignored (help); Unknown parameter |lastauthoramp= ignored (|name-list-style= suggested) (help)


 

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=BF-graph&oldid=897721354"