As a corollary, an edge-transitive hypergraph that is not vertex-transitive is bicolorable. Graph partitioning (and in particular, hypergraph partitioning) has many applications to IC design and parallel computing. == Theorems == Many theorems and concepts involving graphs also hold for hypergraphs. Ramsey`s theorem and Line graph of a hypergraph....
Found on
http://en.wikipedia.org/wiki/Hypergraph
A set of nodes (or vertices), say V, plus a set of edges, say E, such that each member of E is a subset of V. When each member of E has exactly 2 nodes, [V,E] is a graph. The hypergraph is a convenient mathematical way to describe relations that involve more than two objects (nodes). One special case is an IIS hypergraph: each node represents an i....
Found on
http://glossary.computing.society.informs.org/index.php?page=H.html
No exact match found.
