BF-graph
 | This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. (November 2024) |
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
[edit]- G. Gallo; G.Longo; S. Nguyen & S. Pallottino (1993). "Directed hypergraphs and applications" (PDF). Discrete Applied Mathematics. 42 (2–3): 177–201. doi:10.1016/0166-218X(93)90045-P.
- S. Nguyen; D. Pretolani & L. Markenson (1998). "On Some Path Problems on Oriented Hypergraphs". ITA. 32 (1–3): 1–20.
 | This graph theory-related article is a stub. You can help Wikipedia by expanding it. |