نتایج جستجو برای: average degree eccentricity matrix

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

M. JALALI RAD M. SAHELI

The geometric-arithmetic index is another topological index was defined as 2 deg ( )deg ( ) ( ) deg ( ) deg ( ) G G uv E G G u v GA G u v     , in which degree of vertex u denoted by degG (u). We now define a new version of GA index as 4 ( ) 2 ε ( )ε ( ) ( ) ε ( ) ε ( ) G G e uv E G G G u v GA G   u v    , where εG(u) is the eccentricity of vertex u. In this paper we compute this new t...

Journal: :روش های عددی در مهندسی (استقلال) 0
حمزه شکیب و مهرداد صدرنشین h. shakib and m. sadrneshin

in this study, the effective parameters on the inelastic response of asymmetric buildings is evaluated for an ensemble of real iranian earthquake records by considering soil-structure interaction. then, the design eccentricity obtained from the inelastic dynamic soil-structure analysis is compared with the design eccentricity of seisimic codes of iran, atc-3, new zeland, canada, mexico, austral...

Journal: :Electr. J. Comb. 2016
Daniel J. Harvey David R. Wood

Mader first proved that high average degree forces a given graph as a minor. Often motivated by Hadwiger’s Conjecture, much research has focused on the average degree required to force a complete graph as a minor. Subsequently, various authors have considered the average degree required to force an arbitrary graph H as a minor. Here, we strengthen (under certain conditions) a recent result by R...

Journal: :Discrete Mathematics 2001
Robert A. Beezer John E. Riegsecker Bryan A. Smith

Total and average distance are not only interesting invariants of graphs in their own right but are also used for studying properties or classifying graphical systems that depend on the number of edges traversed. Recent examples include studies of computer networks [3] and the use of graphical invariants to partially classify the structure of molecules [1]. There have been a number of conjectur...

Journal: :Journal of Graph Theory 2011
Christian Löwenstein Anders Sune Pedersen Dieter Rautenbach Friedrich Regen

We prove several best-possible lower bounds in terms of the order and the average degree for the independence number of graphs which are connected and/or satisfy some odd girth condition. Our main result is the extension of a lower bound for the independence number of triangle-free graphs of maximum degree at most 3 due to Heckman and Thomas [A New Proof of the Independence Ratio of Triangle-Fr...

2018
Yilun Zheng Yuan He Meng Jin Xiaolong Zheng Yunhao Liu

Eccentricity detection is a crucial issue for highspeed rotating machinery, which concerns the stability and safety of the machinery. Conventional techniques in industry for eccentricity detection are mainly based on measuring certain physical indicators, which are costly and hard to deploy. In this paper, we propose RED, a non-intrusive, low-cost, and realtime RFID-based eccentricity detection...

Journal: :Vision Research 1995
Eileen Kowler Erik Blaser

Subjects made saccades to point and spatially-extended targets located at a randomly-selected eccentricity (3.8-4.2 deg) under conditions designed to promote best possible accuracy based only on the visual information present in a single trial. Saccadic errors to point targets were small. The average difference between mean saccade size and target eccentricity was about 1% of eccentricity. Prec...

Journal: :Investigative ophthalmology & visual science 2009
Vivek Dave Raja Narayanan

PURPOSE To evaluate the degree of metamorphopsia in 42 patients before and 6 months after vitrectomy for idiopathic unilateral macular hole. METHODS Semicircular test and reference stimuli of variable diameters were applied in a binocular test that measured interocular size disparity in patients with unilateral macular hole. The test was applied 1 day before surgery and repeated after 6 month...

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

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