PlanetPhysics/Hypergraph

From testwiki
Jump to navigation Jump to search

A hypergraph or [[../Cod/|metagraph]] is an ordered pair, or couple, (V,) where V is the class of vertices of the hypergraph and is the class of edges such that 𝒫(V), where 𝒫(V) is the powerset of V (the set of subsets of V) and is also considered to be a class.

A hypergraph is as an extension of the [[../PreciseIdea/|concepts]] of a [[../Cod/|graph]], colored graph and multi-graph. A finite hypergraph, with both V and being sets, is also related to a [[../Cod/|metacategory]]; therefore, it can also be considered as a special case of a [[../SuperCategory6/|supercategory]], and can be thus defined as a mathematical interpretation of [[../ETACAxioms/|ETAS axioms]].

A finite hypergraph can also be considered as an example of a simple incidence structure . Note also that the more general definition of a hypergraph given above avoids well known antimonies of set theory involving `sets' of sets in the general case.

Many specific graph definitions (but not all) can be extended to similar specific hypergraph, or multigraph, definitions. For example, let V={v1,v2,,vn} and ={e1,e2,,em}. Associated to any finite hypergraph is the finite n×m incidence [[../Matrix/|matrix]] A=(aij) where

aij={1=if=viej0=otherwise=

For example, let =(V,), where V={a,b,c} and ={{a},{a,b},{a,c},{a,b,c}}. Defining vi and ej in the obvious manner (as they are listed in the sets), we have A=(111101010011)

Template:CourseCat