نتایج جستجو برای: Tenacity

تعداد نتایج: 646  

In this paper we discuss about tenacity and its properties in stability calculation. We indicate relationships between tenacity and connectivity, tenacity and binding number, tenacity and toughness. We also give good lower and upper bounds for tenacity.

Journal: :journal of algorithms and computation 0
peyman nasehpour department of algorithms and computation, faculty of engineering science, university of tehran

in this paper we discuss about tenacity and its properties in stability calculation. we indicate relationships between tenacity and connectivity, tenacity and binding number, tenacity and toughness. we also give good lower and upper bounds for tenacity.

In this paper we discuss about tenacity and its properties in stability calculation. We indicate relationships between tenacity and connectivity, tenacity and binding number, tenacity and toughness. We also give good lower and upper bounds for tenacity. Since we are primarily interested in the case where disruption of the graph is caused by the removal of a vertex or vertices (and the resulting...

2012
Fengwei Li

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...

Numerous networks as, for example, road networks, electrical networks and communication networks can be modeled by a graph. Many attempts have been made to determine how well such a network is "connected" or stated differently how much effort is required to break down communication in the system between at least some nodes. Two well-known measures that indicate how "reliable" a graph is are the...

Journal: :journal of ai and data mining 2014
mohaddeseh dashti vali derhami esfandiar ekhtiyari

yarn tenacity is one of the most important properties in yarn production. this paper addresses modeling of yarn tenacity as well as optimally determining the amounts of the effective inputs to produce yarn with desired tenacity. the artificial neural network is used as a suitable structure for tenacity modeling of cotton yarn with 30 ne. as the first step for modeling, the empirical data is col...

Journal: :British Dental Journal 2008

Yarn tenacity is one of the most important properties in yarn production. This paper addresses modeling of yarn tenacity as well as optimally determining the amounts of the effective inputs to produce yarn with desired tenacity. The artificial neural network is used as a suitable structure for tenacity modeling of cotton yarn with 30 Ne. As the first step for modeling, the empirical data is col...

Journal: :International psychogeriatrics 2013
Rebecca E Kelly Alex M Wood Warren Mansell

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...

2008
Dara Moazzami Behzad Salehian B. Salehian

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 ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید