A large number of applications such as querying sensor networks, and analyzing proteinprotein interaction (PPI) networks, rely on mining uncertain graph and hypergraph databases. In this work we study the following problem: Given an uncertain, weighted (hyper)graph, how can we efficiently find a (hyper)matching with high expected reward, and low risk? This problem naturally arises in the contex...

Changes of cervical sagittal alignment during motion in cervical kyphosis patients have never been published before. This study was to investigate the changes and provide a better reference for orthopedic treatment.Randomized double-blind repeat trial was carried out on 60 patients with cervical kyphosis. On standard position, hyper flexion, and hyper extension sagittal radiographs, the followi...

Fractional (hyper-)graph theory is concerned with the specific problems that arise when fractional analogues of otherwise integer-valued invariants are considered. The focus this paper on edge covers hypergraphs. Our main technical result generalizes and unifies previous conditions under which size support bounded independently hypergraph itself. This allows us to extend tractability results fo...

In this paper, we introduce the notion of hyper pseudo B C K - algebras, which is a generalization of pseudo BCK -algebras and hyper BCK -algebras and we investigates some related properties. In follow, we de ne some kinds of hyper pseudo BCK -ideals of a hyper pseudo BCK - algebra and we find the relations among them. Finally, we characterize the hyper pseudo BCK -ideals of type 4 generated by...

Given a graph whose edges are coloured, on how many vertices can we find a monochromatic subgraph of a certain type, such as a connected subgraph, or a cycle, or some type of tree? Also, how many such monochromatic subgraphs do we need so that their vertex sets form either a partition or a covering of the vertices of the original graph? What happens for the analogous situations for hypergraphs?...

let $g$ be a simple graph of order $n$ and size $m$.the edge covering of $g$ is a set of edges such that every vertex of $g$ is incident to at least one edge of the set. the edge cover polynomial of $g$ is the polynomial$e(g,x)=sum_{i=rho(g)}^{m} e(g,i) x^{i}$,where $e(g,i)$ is the number of edge coverings of $g$ of size $i$, and$rho(g)$ is the edge covering number of $g$. in this paper we stud...

let g=(v,e) be a simple graph. an edge labeling f:e to {0,1} induces a vertex labeling f^+:v to z_2 defined by $f^+(v)equiv sumlimits_{uvin e} f(uv)pmod{2}$ for each $v in v$, where z_2={0,1} is the additive group of order 2. for $iin{0,1}$, let e_f(i)=|f^{-1}(i)| and v_f(i)=|(f^+)^{-1}(i)|. a labeling f is called edge-friendly if $|e_f(1)-e_f(0)|le 1$. i_f(g)=v_f(1)-v_f(0) is called the edge-f...

In this note, we study the lattice structure on the class of all weak hyper K-ideals of a hyper K-algebra. We first introduce the notion of (left,right) scalar in a hyper K-algebra which help us to characterize the weak hyper K-ideals generated by a subset. In the sequel, using the notion of a closure operator, we study the lattice of all weak hyper K-ideals of ahyper K-algebra, and we prove a ...

The intuitionistic fuzzification of (strong, weak, s-weak) hyperBCK-ideals is introduced, and related properties are investigated. Characterizationsof an intuitionistic fuzzy hyper BCK-ideal are established. Using acollection of hyper BCK-ideals with some conditions, an intuitionistic fuzzyhyper BCK-ideal is built.

In this note we consider the notion of intuitionistic fuzzy (weak) dual hyper K-ideals and obtain related results. Then we classify this notion according to level sets. After that we determine the relationships between intuitionistic fuzzy (weak) dual hyper K-ideals and intuitionistic fuzzy (weak) hyper K-ideals. Finally, we define the notion of the product of two intuitionistic fuzzy (weak) du...