Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Study on Hypergraphs and Directed Hypergraphs

View through CrossRef
A graph is often thought of as an abstract structure that represents the pairwise connections between collections of objects known as vertices. Two vertices may be linked by an edge or can exist independently of one another. Allowing an edge to link an arbitrary number of vertices is one method to broaden this notion. Hyperedges are subsets of the vertex set, and they are referred to as such. A hypergraph is made up of a set of vertices and a family of hyperedges. Hypergraphs are more abstract than graphs, having less structure. Hypergraphs, rather than graphs, are better suited as a modelling paradigm in certain situations. Hypergraphs are used to simulate tram lines in [Karbstein, 2012]) and railway vehicle coupling in [Borndörfer et al., 2012] in the area of transportation planning. See [Eiter and Gottlob, 1995] for examples of hypergraphs in the fields of logic and artificial intelligence. In addition, both directed and undirected hypergraphs are effectively employed in the area of biological networks analysis for a brief review, see [Klamt et al., 2009]. Protein interactions, for example, often include more than one protein, therefore hyperedges rather than edges may be utilised to simulate them more correctly.
Title: Study on Hypergraphs and Directed Hypergraphs
Description:
A graph is often thought of as an abstract structure that represents the pairwise connections between collections of objects known as vertices.
Two vertices may be linked by an edge or can exist independently of one another.
Allowing an edge to link an arbitrary number of vertices is one method to broaden this notion.
Hyperedges are subsets of the vertex set, and they are referred to as such.
A hypergraph is made up of a set of vertices and a family of hyperedges.
Hypergraphs are more abstract than graphs, having less structure.
Hypergraphs, rather than graphs, are better suited as a modelling paradigm in certain situations.
Hypergraphs are used to simulate tram lines in [Karbstein, 2012]) and railway vehicle coupling in [Borndörfer et al.
, 2012] in the area of transportation planning.
See [Eiter and Gottlob, 1995] for examples of hypergraphs in the fields of logic and artificial intelligence.
In addition, both directed and undirected hypergraphs are effectively employed in the area of biological networks analysis for a brief review, see [Klamt et al.
, 2009].
Protein interactions, for example, often include more than one protein, therefore hyperedges rather than edges may be utilised to simulate them more correctly.

Related Results

Complement Reducible Uniform Hypergraphs
Complement Reducible Uniform Hypergraphs
We investigate a generalization of complement reducible graphs, called co-graphs, for r-uniform hypergraphs. The operations of r-co-hypergraphs are the disjoint union of two given ...
A Systematic Research on Various Types of Hausdorff Hypergraphs
A Systematic Research on Various Types of Hausdorff Hypergraphs
A hypergraph H = (V, E) is said to be a Hausdorff hypergraph if for any two distinct vertices u, v of V there exist hyperedges e1, e2 ∈ E such that u ∈ e1, v ∈ e2 and e1 ∩ e2 = ∅. ...
Completion and decomposition of hypergraphs by domination hypergraphs
Completion and decomposition of hypergraphs by domination hypergraphs
A graph consists of a finite non-empty set of vertices and a set of unordered pairs of vertices, called edges. A dominating set of a graph is a set of vertices D such that every ve...
Hypergraph partitioning using tensor eigenvalue decomposition
Hypergraph partitioning using tensor eigenvalue decomposition
Hypergraphs have gained increasing attention in the machine learning community lately due to their superiority over graphs in capturingsuper-dyadicinteractions among entities. In t...
Connectivity and routes in large geometric network hypergraphs
Connectivity and routes in large geometric network hypergraphs
Random geometric hypergraphs are considered as mathematical models of large wireless computer networks. The dependences of the mathematical expectation of the number of hyper-edges...
Dynamic hypergraphs of renewal processes in mobile networks.
Dynamic hypergraphs of renewal processes in mobile networks.
The characteristics of random geometric hypergraphs are studied as mathematical models of scalable wireless computer networks. An efficient algorithm for finding cliques in geometr...
Revealing Hierarchical Uncertainty with Quadri- and PentaPartitioned Neutrosophic HyperGraphs and SuperHyperGraphs
Revealing Hierarchical Uncertainty with Quadri- and PentaPartitioned Neutrosophic HyperGraphs and SuperHyperGraphs
Graph theory offers a foundational framework for modeling relationships through vertices and edges [1, 2]. Hypergraphs broaden this framework by introducing hyperedges that link mu...

Back to Top