the notion of strong arcs in a fuzzy graph was introduced bybhutani and rosenfeld in [1] and fuzzy end nodes in the subsequent paper[2] using the concept of strong arcs. in mordeson and yao [7], the notion of“degrees” for concepts fuzzified from graph theory were defined and studied.in this note, we discuss degrees for fuzzy end nodes and study further someproperties of fuzzy end nodes and fuzz...

Here, we report the growth of homogenously horizontally aligned single wall carbon nanotubes on stable temperature cut single crystal quartz using chemical vapor deposition with controllable yield and length from binary metallic mixtures as well as fullerene derivatives. We manage the yield and length of the as-grown tubes on stable temperature cut single crystal quartz by controlling the surfa...

Floodplain meadows support a high level of botanical diversity because the nutrient inputs from flood sediments are balanced by offtake via an annual hay harvest, leading to neutrality. This prevents build-up nitrogen (N) and phosphorus (P) depletes excess nutrients, which mitigates eutrophication in catchment areas reductions biodiversity through competitive exclusion. A replicated field trial...

We describe a simple greedy algorithm whose input is a set P of vertices on a combinatorial surface S without boundary and that computes a shortest cut graph of S with vertex set P . (A cut graph is an embedded graph whose removal leaves a single topological disk.) If S has genus g and complexity n, the running-time is O(n log n+(g + |P |)n). This is an extension of an algorithm by Erickson and...

Correlation Clustering is an elegant model that captures fundamental graph cut problems such as Min s − t Cut, Multiway Cut, and Multicut, extensively studied in combinatorial optimization. Here, we are given a graph with edges labeled + or − and the goal is to produce a clustering that agrees with the labels as much as possible: + edges within clusters and − edges across clusters. The classica...

For a large class of irregular mesh applications, the structure of the mesh changes from one phase of the computation to the next. Eventually, as the mesh evolves, the adapted mesh has to be repartitioned to ensure good load balance. If this new graph is partitioned from scratch, it may lead to an excessive migration of data among processors. In this paper, we present schemes for computing repa...

Submarine cable cuts have become increasingly common, with five incidents breaking more than ten cables in the last three years. Today, around 300 cables carry the majority of international Internet traffic, so a single cable cut can affect millions of users, and repairs to any cut are expensive and time consuming. Prior work has either measured the impact following incidents, or predicted the ...

This study aimed to investigate the potential of giant reed for biomethane production by examining the influence of harvest time and frequency on the Biochemical Methane Potential (BMP), the kinetics of biomethane accumulation in batch reactors and the expected methane yield per hectare. The crop was cut at five different times, regrowths from early cuts were harvested in autumn and BMP of each...

In Van den Akker, Van Hoesel, and Savelsbergh 1994], we have studied a time-indexed formulation for single-machine scheduling problems and have presented a complete characterization of all facet inducing inequalities with right-hand sides 1 and 2 of the convex hull of the monotone extension of the set of feasible schedules. In this paper, we discuss the development of a branch-and-cut algorithm...