Top-down partitioning has focused on minimum cut or ratio cut objectives, while bottom-up clustering has focused on density-based objectives. In seeking a more uni ed perspective, we propose a new sum of densities measure for multi-way circuit decomposition, where the density of a subhypergraph is the ratio of the number of edges to the number of nodes in the subhypergraph. Finding a k-way part...

In this paper, we introduce the notion of {bf K}-flat projective fuzzy quantales, and give an elementary characterization in terms of a fuzzy binary relation on the fuzzy quantale. Moreover, we  prove that {bf K}-flat projective fuzzy quantales are precisely the coalgebras for a certain comonad on the category of fuzzy quantales. Finally, we present two special cases of {bf K} as examples.

Let $G$ be a graph. Let $f:V(G)to{0,1,2, ldots, k-1}$ be a map where $k in mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $left|f(u)-f(v)right|$. $f$ is called a $k$-total difference cordial labeling of $G$ if $left|t_{df}(i)-t_{df}(j)right|leq 1$, $i,j in {0,1,2, ldots, k-1}$ where $t_{df}(x)$ denotes the total number of vertices and the edges labeled with $x$.A graph with admits a...

We survey problems, results, and methods concerning k-facets and k-sets of finite point sets in real affine d-space and the dual notion of levels in arrangements of hyperplanes.

for every positive integer k, a set s of vertices in a graph g = (v;e) is a k- tuple dominating set of g if every vertex of v -s is adjacent to at least k vertices and every vertex of s is adjacent to at least k - 1 vertices in s. the minimum cardinality of a k-tuple dominating set of g is the k-tuple domination number of g. when k = 1, a k-tuple domination number is the well-studied domination...