Search
Search Results
-
Interval-valued picture fuzzy hypergraphs with application towards decision making
The concept of interval-valued picture fuzzy sets (IVPFSs) is the most generalized form of fuzzy sets (FSs) and is proven a useful tool to manipulate...
-
Incidence hypergraphs: the categorical inconsistency of set-systems and a characterization of quiver exponentials
This paper considers the difficulty in the set-system approach to generalizing graph theory. These difficulties arise categorically as the category...
-
A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs
We consider the multilinear polytope defined as the convex hull of the set of binary points z , satisfying a collection of equations of the form
... 
-
Novel group decision making approach based on the rough soft approximations of graphs and hypergraphs
Rough soft knowledge is a key approach to understand and model uncertain, vague and not clearly defined situations in a parametric manner. Graphs,...
-
Information geometry of dynamics on graphs and hypergraphs
We introduce a new information-geometric structure associated with the dynamics on discrete objects such as graphs and hypergraphs. The presented...
-
Matching orderable and separable hypergraphs
A perfect matching in a hypergraph is a set of edges that partition the set of vertices. We study the complexity of deciding the existence of a...
-
Computing Motifs in Hypergraphs
Motifs are overrepresented and statistically significant sub-patterns in a network, whose identification is relevant to uncover its underlying...
-
Min–Max Partitioning of Hypergraphs and Symmetric Submodular Functions
We consider the complexity of minmax partitioning of graphs, hypergraphs and (symmetric) submodular functions. Our main result is an algorithm for...
-
p-Laplace Operators for Oriented Hypergraphs
The p -Laplacian for graphs, as well as the vertex Laplace operator and the hyperedge Laplace operator for the general setting of oriented...
-
Packing Hypertrees and the k-cut Problem in Hypergraphs
We give a combinatorial algorithm to find a maximum packing of hypertrees in a capacitated hypergraph. Based on this we extend to hypergraphs several...
-
Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization
This work starts a new level of research in the area of conflict graphs and hypergraphs. We introduce a new term “mixed conflict hypergraphs”, which...
-
Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k
We consider the problem of deterministically enumerating all minimum k -cut-sets in a given hypergraph for fixed constant k . The input here is a...
-
Discrete-to-Continuous Extensions: Lovász Extension and Morse Theory
This is the first of a series of papers that develop a systematic bridge between constructions in discrete mathematics and the corresponding...
-
Projective Dimension of Hypergraphs
Given a square-free monomial ideal I, satisfying certain hypotheses, in a polynomial ring R over a field...
-
Bipolar Fuzzy (Directed) Hypergraphs
In this chapter, we present the concept of bipolar fuzzy hypergraphs and directed hypergraphs. We describe certain operations on bipolar fuzzy...
-
Hypergraph Edge Representations with the Use of Homological Paths
AbstractWe consider the problem of realization of hypergraphs on a graph provided each hyperedge is realized by a subgraph in which exactly two...
-
Fuzzy Hypergraphs and Related Extensions
This book presents the fundamental and technical concepts of fuzzy hypergraphs and explains their extensions and applications. It discusses applied...