The tenacity of an incomplete connected graph G is defined as T (G) = min{ |S|+m(G−S) ω(G−S) : S ⊂ V (G), ω(G− S) > 1}, where ω(G− S) and m(G− S), respectively, denote the number of components and the order of a largest component inG−S. This is a reasonable parameter to measure the vulnerability of networks, as it takes into account both the amount of work done to damage the network and how bad...

The increasing interest in unrefined flour-based products demands innovative strategies to improve dough properties and bread quality. This study investigated the effect of an empirical practice used by bakers – gradual flour addition during kneading on wholewheat After optimizing operating conditions perform kneading, a full factorial design tested optimized samples as function total water con...

In this paper, we introduce the novel parameters indicating Normalized Tenacity ($T_N$) and Normalized Toughness ($t_N$) by a modification on existing Tenacity and Toughness parameters.  Using these new parameters enables the graphs with different orders be comparable with each other regarding their vulnerabilities. These parameters are reviewed and discussed for some special graphs as well.

-A six-year capture-recapture study allowed us to assess site-tenacity and spatial distribution of site-tenacious individuals in a population of the terrestrial, ovoviviparous Salamandra salamandra from Sintra-Cascais Natural Park, Portugal. The study area, an abandoned orchard, maintained large numbers of S, salamandra (about 400/ha), Most site-tenacious individuals were associated with tunnel...

We prove that the homeomorphism problem for 2–manifolds can be decided in logspace. The proof relies on Reingold’s logspace solution to the undirected s, t-connectivity problem in graphs.

BACKGROUND Previous research has shown that tendencies to tenaciously pursue goals and flexibly adapt goals independently relate to well-being in adults in mid-to-late life, but research has not tested whether these tendencies interact. For example, tenacity may only predict well-being in combination with flexibility. This research tests whether these tendencies interact to predict changes in h...

The edge-tenacity Te(G) of a graph G was defined as Te(G) = min F⊂E(G) {| F | +τ(G− F ) ω(G− F ) } where the minimum is taken over all edge cutset F of G. We define G-F to be the graph induced by the edges of E(G) − F , τ(G − F ) is the number of edges in the largest component of the graph induced by G-F and ω(G−F ) is the number of components of G− F . A set F ⊂ E(G) is said to be a Te-set of ...

In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of interval graphs are polynomial. In this paper, two different vulnerability parameters of graphs, tenacity and rupture degree are defined. In general, computing the tenacity o...

High volume instrumentation (HVITM) measurement is a primary and routine tool of providing fiber properties to cotton researchers. There have been considerable studies designed to derive yarn quality from acquired fiber quality data by various means, including HVI. There is also of desired information about the comparison of yarn quality within a cotton cultivar or among the cultivars, as such ...