نتایج جستجو برای: distance of graph
تعداد نتایج: 21188805 فیلتر نتایج به سال:
Abstract We study the concept of continuous mean distance a weighted graph. For connected unweighted graphs, can be defined as arithmetic distances between all pairs vertices. This parameter provides natural measure compactness graph, and has been intensively studied, together with several variants, including its version for graphs. The analog (discrete) is points on edges Despite being very ge...
Let G be a simple connected graph. The generalized polarity Wiener index of G is defined as the number of unordered pairs of vertices of G whose distance is k. Some formulas are obtained for computing the generalized polarity Wiener index of the Cartesian product and the tensor product of graphs in this article.
Let G=(V,E) be a graph where v(G) and E(G) are vertices and edges of G, respectively. Sum of distance between vertices of graphs is called wiener invariant. In This paper, we present some proved results on the wiener invariant and some new result on the upper bound of wiener invariant of k-connected graphs.
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید