Let G and H be respectively a graph hypergraph defined on same set of vertices, let F fixed graph. We say that F-overlays hyperedge S if is spanning subgraph the induced by S, it every H. Motivated structural biology, we study computational complexity two problems. The first problem, (Δ≤k) F-Overlay, consists in deciding whether there with maximum degree at most k given It particular case secon...

This work presents a new methodology for ventricular premature contraction arrhythmias recognition using set of geometrical attributes recently proposed and fuzzy maximum approaching degree. Pattern models based on triangular trapezoidal membership functions are committee comprising these is composed some statistical data, beyond mechanism manual selection automatic weighting each attribute. Th...

This article proposes a framework of personalized feedback mechanism to help multiple inconsistent experts reach consensus in group decision making by allowing select different parameters according individual degree. The general harmony degree (GHD) is defined determine the before/after difference between original and revised opinions. It proved that GHD index monotonically decreasing with resp...

Let $\mathcal{H}$ be an $r$-uniform hypergraph. The minimum positive co-degree of $\mathcal{H}$, denoted by $\delta_{r-1}^+(\mathcal{H})$, is the $k$ such that if $S$ $(r-1)$-set contained in a hyperedge then at least hyperedges $\mathcal{H}$. For $r\geq k$ fixed and $n$ sufficiently large, we determine maximum possible size intersecting $n$-vertex hypergraph with $\delta_{r-1}^+(\mathcal{H}) \...