نتایج جستجو برای: resistance distance in graph

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

Journal: :IEEE Transactions on Pattern Analysis and Machine Intelligence 2005

Journal: :Bulletin: Classe des sciences mathematiques et natturalles 2006

Journal: :Expert Systems with Applications 2018

2005
I. GUTMAN W. XIAO I. Gutman W. Xiao

Académie serbe des sciences et des arts-2004 Classe des sciences mathématiques et naturelles sciences mathématiques, N o 29 A b s t r a c t. The generalized inverse L † of the Laplacian matrix of a connected graph is examined and some of its properties are established. In some physical and chemical considerations the quantity r ij = (L †) ii + (L †) jj − (L †) ij − (L †) ji is encountered; it i...

2011
Elena Shamis

We propose a new graph metric and study its properties. In contrast to the standard distance in connected graphs [5], it takes into account all paths between vertices. Formally, it is defined as d(i, j) = qii+qjj−qij−qji [11], where qij is the (i, j)-entry of the relative forest accessibility matrix Q(ε) = (I + εL)−1, L is the Laplacian matrix of the (weighted) (multi)graph, and ε is a positive...

2006
Elena Shamis

We propose a new graph metric and study its properties. In contrast to the standard distance in connected graphs [5], it takes into account all paths between vertices. Formally, it is defined as d(i, j) = qii+qjj−qij−qji [11], where qij is the (i, j)-entry of the relative forest accessibility matrix Q(ε) = (I + εL)−1, L is the Laplacian matrix of the (weighted) (multi)graph, and ε is a positive...

2013
Pavel Yu. Chebotarev

In data analysis, there is a strong demand for graph metrics that differ from the classical shortest path and resistance distances. Recently, several new classes of graph metrics have been proposed. This paper presents some of them featuring the cutpoint additive distances. These include the path distances, the reliability distance, the walk distances, and the logarithmic forest distances among...

Journal: :Electronic Notes in Discrete Mathematics 2002
Pavel Yu. Chebotarev Elena Shamis

We propose a new graph metric and study its properties. In contrast to the standard distance in connected graphs [5], it takes into account all paths between vertices. Formally, it is defined as d(i, j) = qii+qjj−qij−qji [11], where qij is the (i, j)-entry of the relative forest accessibility matrix Q(ε) = (I + εL)−1, L is the Laplacian matrix of the (weighted) (multi)graph, and ε is a positive...

Journal: :journal of paramedical sciences 0
kamal mirzaie badrabadi department of computer engineering, maybod branch, islamic azad university, maybod, iran mehdi mirzaie department of computational biology, faculty of high technologies, tarbiat modares university, tehran, iran

protein structural flexibility is important for catalysis, binding, protein design, and allostery. some simple methods have recently been introduced to compute protein flexibility directly from the protein structure without any mechanical models. for example the atomic mean square displacement (or b-factor) is related to the number of neighboring atoms. the protein structure can be modeled as a...

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

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